|
8
|
Fast 3-Coloring Triangle-Free Planar Graphs
– Łukasz Kowalik
- 2004
|
|
55
|
Ein Dreifarbensatz für dreikreisfreie Netz auf der
– H Grötzsch
- 1958
|
|
8
|
Three-coloring triangle-free graphs on surfaces
– Z Dvoˇrák, D Král’, R Thomas
- 2009
|
|
19
|
Coloring graphs with fixed genus and girth
– John Gimbel, Carsten Thomassen
- 1997
|
|
9
|
The chromatic number of a graph of girth 5 on a fixed surface
– Carsten Thomassen
|
|
42
|
Graph minors. VII. Disjoint paths on a surface
– N Robertson, P D Seymour
- 1988
|
|
25
|
Grötzsch’s 3-color theorem and its counterparts for the torus and the projective plane
– C Thomassen
- 1994
|
|
8879
|
Computers and Intractability: A guide to the Theory of NP-Completeness
– M Garey, D Johnson
- 1979
|
|
4
|
Threecoloring triangle-free planar graphs in linear time
– Ken-ichi Kawarabayashi, Robin Thomas
|
|
11
|
Ossona de Mendez: Linear time low tree width partitions and algorithmic consequences
– J Neˇsetˇril, P
- 2006
|
|
18
|
Ossona de Mendez: Grad and Classes with bounded expansion III
– J Neˇsetˇril, P
|
|
89
|
Subgraph Isomorphism in Planar Graphs and Related Problems
– David Eppstein
- 1999
|
|
3
|
A new planarity test, Theoret
– W-K Shih, W-L Hsu
- 1999
|
|
29
|
Every planar map is four colorable, Part I: Discharging
– K Appel, W Haken
- 1977
|
|
26
|
Every planar map is four-colorable, Part II: Reducibility
– K Appel, W Haken, J Koch
- 1989
|
|
98
|
The Four-Colour Theorem
– Neil Robertson, Daniel Sanders, Paul Seymour, Robin Thomas
- 1997
|
|
5
|
Three-Coloring Klein Bottle Graphs Of Girth Five
– Robin Thomas, Barrett Walls
- 2004
|
|
8
|
Graphs on surfaces, The Johns Hopkins
– B Mohar, C Thomassen
- 2001
|
|
16
|
A short list color proof of Grötzsch’s theorem
– C Thomassen
|
