On tree-partition-width

European Journal of Combinatorics

Volumn 30, Issue 5, 2009, Pages 1245-1253

  Wood, David R ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 63149094551     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2008.11.010     Document Type: Article

References (27)

1. Bodlaender H.L., and Engelfriet J. Domino treewidth. J. Algorithms 24 1 (1997) 94-123
2. Seese D. Tree-partite graphs and the complexity of algorithms. In: Budach L. (Ed). Proc. International Conf. on Fundamentals of Computation Theory. Lecture Notes in Comput. Sci. vol. 199 (1985), Springer 412-421
3. Halin R. Tree-partitions of infinite graphs. Discrete Math. 97 (1991) 203-217
4. Bodlaender H.L. A note on domino treewidth. Discrete Math. Theor. Comput. Sci. 3 4 (1999) 141-150
5. Ding G., and Oporowski B. Some results on tree decomposition of graphs. J. Graph Theory 20 4 (1995) 481-499
6. Ding G., and Oporowski B. On tree-partitions of graphs. Discrete Math. 149 1-3 (1996) 45-58
7. Edenbrandt A. Quotient tree partitioning of undirected graphs. BIT 26 2 (1986) 148-155
8. Wood D.R. Vertex partitions of chordal graphs. J. Graph Theory 53 2 (2006) 167-172
9. Carmi P., Dujmović V., Morin P., and Wood D.R. Distinct distances in graph drawings. Electron. J. Combin. 15 (2008) R107
10. Giacomo E.D., Liotta G., and Meijer H. Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. Theory Appl. 32 1 (2005) 26-58
11. Dujmović V., Morin P., and Wood D.R. Layout of graphs with bounded tree-width. SIAM J. Comput. 34 3 (2005) 553-579
12. Dujmović V., Suderman M., and Wood D.R. Graph drawings with few slopes. Comput. Geom. Theory Appl. 38 (2007) 181-193
13. Wood D.R., and Telle J.A. Planar decompositions and the crossing number of graphs with an excluded minor. New York J. Math. 13 (2007) 117-146
14. Barát J., and Wood D.R. Notes on nonrepetitive graph colouring. Electron. J. Combin. 15 (2008) R99
15. Alon N., Ding G., Oporowski B., and Vertigan D. Partitioning into graphs with only small components. J. Combin. Theory Ser. B 87 2 (2003) 231-243
16. Kuske D., and Lohrey M. Logical aspects of Cayley-graphs: The group case. Ann. Pure Appl. Logic 131 1-3 (2005) 263-286
17. Bodlaender H.L. The complexity of finding uniform emulations on fixed graphs. Inform. Process. Lett. 29 3 (1988) 137-141
18. Bodlaender H.L. The complexity of finding uniform emulations on paths and ring networks. Inform. and Comput. 86 1 (1990) 87-106
19. Bodlaender H.L., and Leeuwen J.v. Simulation of large networks on smaller networks. Inform. and Control 71 3 (1986) 143-180
20. Fishburn J.P., and Finkel R.A. Quotient networks. IEEE Trans. Comput. C-31 4 (1982) 288-295
21. Diestel R., and Kühn D. Graph minor hierarchies. Discrete Appl. Math. 145 2 (2005) 167-182
22. Reed B.A., and Seymour P.D. Fractional colouring and Hadwiger's conjecture. J. Combin. Theory Ser. B 74 2 (1998) 147-152
23. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 1-2 (1998) 1-45
24. Reed B.A. Algorithmic aspects of tree width. In: Reed B.A., and Sales C.L. (Eds). Recent Advances in Algorithms and Combinatorics (2003), Springer 85-107
25. Robertson N., and Seymour P.D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 3 (1986) 309-322
26. Eckhoff J. Extremal interval graphs. J. Graph Theory 17 1 (1993) 117-127
27. Diestel R. Graph Theory. 2nd ed. Graduate Texts in Mathematics vol. 173 (2000), Springer