Vertex partitions of chordal graphs

Journal of Graph Theory

Volumn 53, Issue 2, 2006, Pages 167-172

  Wood, David R ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Chordal graph; k tree; Tree partition; Tree width; Vertex partition

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; TREES (MATHEMATICS);

CHORDAL GRAPH; K-TREE; TREE-PARTITION; TREE-WIDTH; VERTEX PARTITION;

GRAPH THEORY;

EID: 33749487391     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20183     Document Type: Article

References (18)

1. N. Alon, G. Ding, B. Oporowski, and D. Vertigan, Partitioning into graphs with only small components, J Combin Theory Ser B 87(2) (2003), 231-243.
2. H. L. Bodlaender, A note on domino treewidth, Discrete Math Theor Comput Sci 3(4) (1999), 141-150.
3. H. L. Bodlaender and J. Engelfriet, Domino treewidth, J Algorithms 24(1) (1997), 94-123.
4. O. V. Borodin, D. Fon-Der-Flaass, A. V. Kostochka, A. Raspaud, and É. Sopena, On deeply critical oriented graphs, J Combin Theory Ser B 81(1) (2001), 150-155.
5. M. De Vos, G. Ding, B. Oporowski, D. P. Sanders, B. Reed, P. Seymour, and D. Vertigan, Excluding any graph as a minor allows a low tree-width 2-coloring, J Combin Theory Ser B 91(1) (2004), 25-41.
6. G. Ding and B. Oporowski, Some results on tree decomposition of graphs, J Graph Theory 20(4) (1995), 481-499.
7. G. Ding and B. Oporowski, On tree-partitions of graphs, Discrete Math 149(1-3) (1996), 45-58.
8. G. Ding, B. Oporowski, D. P. Sanders, and D. Vertigan, Partitioning graphs of bounded tree-width, Combinatorica 18(1) (1998), 1-12.
9. G. Ding, B. Oporowski, D. P. Sanders, and D. Vertigan, Surfaces, tree-width, clique-minors, and partitions, J Combin Theory Ser B 79(2) (2000), 221-246.
10. V. Dujmović, P. Morin, and D. R. Wood, Layout of graphs with bounded tree-width, SIAM J Comput 34(3) (2005), 553-579.
11. A. Edenbrandt, Quotient tree partitioning of undirected graphs, BIT 26(2) (1986), 148-155.
12. R. Halin, Tree-partitions of infinite graphs, Discrete Math 97 (1991), 203-217.
13. J. J. Montellano-Ballesteros, A. Por, and R. Strausz, Tverberg-type theorems for separoids, Discrete Comput Geom 35(3) (2006), 513-523.
14. J. Nešetřil and P. O. De Mendez, Grad and classes with bounded expansion I, Decompositions, 2005. http://arxiv.org/abs/math.CO/0508323.
15. B. Reed and P. Seymour, Fractional colouring and Hadwiger's conjecture, J Combin Theory Ser B 74(2) (1998), 147-152.
16. D. Seese, Tree-partite graphs and the complexity of algorithms, In: Proc International Conf on Fundamentals of Computation Theory, vol. 199 of Lecture Notes in Comput Sci (L. Budach, editor), Springer, 1985, pp. 412-421.
17. É. Sopena, The chromatic number of oriented graphs, J Graph Theory 25(3) (1997), 191-205.
18. D. R. Wood, A note on tree-partition-width, 2006. http://arxiv.org/abs/ math.CO/0602507.