Partitioning into graphs with only small components

Journal of Combinatorial Theory. Series B

Volumn 87, Issue 2, 2003, Pages 231-243

  Alon, Noga ^a   Ding, Guoli ^b   Oporowski, Bogdan ^b   Vertigan, Dirk ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Edge partitions; Small components; Tree width; Vertex partitions

Indexed keywords

EID: 0037374155     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00006-0     Document Type: Article

References (12)

1. N. Alon, The linear arboricity of graphs, Israel J. Math. 62 (1988) 311-325.
2. N. Alon, J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
3. N. Alon, V.J. Teague, N.C. Wormald, Linear arboricity and linear k-arboricity of regular graphs, Graphs Combin. 17 (2001) 11-16.
4. M. DeVos, G. Ding, B. Oporowski, B. Reed, D.P. Sanders, P. Seymour, D. Vertigan, Excluding any graph as a minor allows a low tree-width 2-coloring, preprint.
5. G. Ding, B. Oporowski, On tree-partitions of graphs, Discrete Math. 149 (1996) 45-58.
6. G. Ding, B. Oporowski, D.P. Sanders, D. Vertigan, Partitioning into graphs with only small components, preprint.
7. P. Erdos, H. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Matin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12 (1963) 251-257.
8. P.E. Haxell, A note on vertex list coloring, preprint.
9. R. Hochberg, C. McDiarmid, M. Saks, On the bandwidth of triangulated triangles, Discrete Math. 138 (1995) 261-265.
10. L. Lovász, On decomposition of graphs, Stud. Sci. Math. Hung. 1 (1966) 237-238.
11. J. Petersen, Die Theorie der regulären Grapben, Acta Math. 15 (1891) 193-220.
12. C. Thomassen, Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5, J. Combin. Theory Ser. B 75 (1999) 100-109.