Hadwiger’s conjecture for K6-free graphs (1993)

by Neil Robertson , Paul Seymour , Robin Thomas
Venue:COMBINATORICA
Citations:35 - 2 self

Documents Related by Co-Citation

70 Über eine Klassifikation der Streckenkomplexe – H Hadwiger - 1943
60 Über eine Eigenschaft der ebenen Komplexe – K Wagner - 1937
281 Every planar map is four-colorable – K Appel, W Haken - 1977
75 An extremal function for contractions of graphs – A Thomason - 1984
20 A survey of Hadwiger’s conjecture – B Toft - 1996
54 The extremal function for complete minors – A Thomason
54 The minimum Hadwiger number for graphs with a given mean degree of vertices (in Russian), Metody Diskret – A Kostochka - 1982
64 A property of 4-chromatic graphs and some remarks on critical graphs – G Dirac - 1952
47 A lower bound for the Hadwiger number of graphs by their average degree – A. V. Kostochka - 1984
117 The Four-Colour Theorem – Neil Robertson, Daniel Sanders, Paul Seymour, Robin Thomas - 1997
39 Homomorphiesatze fur Graphen – W Mader - 1968
259 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
7 Any 7-chromatic graph has K7 or K4,4 as a minor – K Kawarabayashi, B Toft - 2005
23 Über eine Eigenschaft der eben Komplexe – K Wagner - 1937
822 Introduction to Graph Theory – D B West - 2001
7 3n − 5 edges do force a subdivision of K5 – W Mader - 1998
27 Improper colourings of graphs – D R Woodall - 1990
166 Sur le problème des courbes gauches en topologie – K Kuratowski - 1930
23 Graphs with forbidden subgraphs – G Chartrand, D Geller, T Hedetniemi - 1971