Vertex partitions of K4,4-minor free graphs

Graphs and Combinatorics

Volumn 17, Issue 2, 2001, Pages 265-274

  Jørgensen, Leif K ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4644273849     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007245     Document Type: Article

References (13)

1. Appel, K., Haken, W.: Every planar map is four colorable. Part I: Discharging. Ill. J. Math. 21, 429-490 (1977)
2. Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. Part II: Reducibility. Ill. J. Math. 21, 491-567 (1977)
3. Chartrand, G., Geller, D.P., Hedetniemi, S.T.: Graphs with forbidden subgraphs. J. Comb. Theory 10, 12-41 (1971)
4. Chartrand, G., Kronk, H.V.: The Point-Arboricity of Planar Graphs. J. Lond. Math. Soc. 44, 612-616 (1969)
5. Hadwiger, H.: Über eine Klassifikation der Streckenkomplexe. Vierteljahrsschrift der Naturf, Gesellschaft in Zürich 88, 133-142 (1943)
6. Hanson, D., Toft, B.: The (m, n)-conjecture is false. Bull. Inst. Comb. Appl. 11, 59-66 (1994)
7. Jacob, H., Meyniel, H.: Extension of Turan's and Brooks' Theorems and New Notion of Stability and Coloring in Digraphs. Ann. Discrete Math. 17, 365-370 (1983)
8. 8. J. Graph Theory 18, 431-448 (1994)
9. Kronk, H.V., Mitchem, J.: Critical point-arboritic graphs. J. Lond. Math. Soc. 2 9, 459-466 (1974)
10. Mader, W.: Homomorphiesätze für Graphen. Math. Ann. 178, 154-168 (1968)
11. Ding, G., Oporowski, B., Sanders, D.P., Vertigan, D.: Surfaces, Tree-Width, Clique-Minors, and Partitions. J. Comb. Theory Ser. B 79, 221-246 (2000)
12. Wegner, G.: Note on a paper of B. Grünbaum on acyclic colorings. Isr. J. Math. 14, 409-412 (1973)
13. Woodall, D.R.: Improper colourings of graphs. In: R. Nelson and R. J. Wilson: Graph Colourings, Pitman Res. Notes Math. Ser. 218, pp 45-63, Longman (1990)