Let H and G be graph classes. We say that H has the Erd" os-PΓ³sa property for G if for any graph G β G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertso
β¦ LIBER β¦
Square Roots of Minor Closed Graph Classes
β Scribed by Nestor V. Nestoridis; Dimitrios M. Thilikos
- Book ID
- 119236632
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 190 KB
- Volume
- 38
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Strengthening ErdΓΆsβPΓ³sa property for mi
β
Fedor V. Fomin; Saket Saurabh; Dimitrios M. Thilikos
π
Article
π
2010
π
John Wiley and Sons
π
English
β 86 KB
Some minor-closed classes of signed grap
β
Slilaty, Daniel; Zhou, Xiangqian
π
Article
π
2013
π
Elsevier Science
π
English
β 431 KB
Quantum Query Complexity of Minor-Closed
β
Childs, Andrew M.; Kothari, Robin
π
Article
π
2012
π
Society for Industrial and Applied Mathematics
π
English
β 392 KB
List-colouring the square of a -minor-fr
β
Timothy J. Hetherington; Douglas R. Woodall
π
Article
π
2008
π
Elsevier Science
π
English
β 195 KB
Shortest paths in linear time on minor-c
β
Siamak Tazari; Matthias MΓΌller-Hannemann
π
Article
π
2009
π
Elsevier Science
π
English
β 963 KB
A class of clique-closed graphs
β
Chai-Ling Deng; Chong-Keang Lim
π
Article
π
1994
π
Elsevier Science
π
English
β 406 KB
Let K(G) denote the clique graph of a graph G. If q is a class of graphs, then define K(W) to be {K(G): G&}. The class QF is called a clique-closed class if V= K(%'). A graph G is said to have the D,-property if G has both the Helly and'the T,-properties. In this paper, we show that the class of D,