The following pages link to Grötzsch's theorem on 3-colorings (Q2625676):
Displaying 40 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Adynamic coloring of graphs (Q777385) (← links)
- All complete graph-wheel planar Ramsey numbers (Q897297) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Irreducible graphs in the Grünbaum-Havel 3-colour problem (Q1126208) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- Some counterexamples associated with the three-color problem (Q1139601) (← links)
- Nowhere-zero 3-flows of highly connected graphs (Q1208358) (← links)
- Some results in topological graph theory (Q1241523) (← links)
- Star chromatic number of triangle-free planar graphs (Q1324451) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)
- A new proof of Grünbaum's 3 color theorem (Q1357735) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- Some combinatorial problems (Q1802136) (← links)
- All quadrilateral-wheel planar Ramsey numbers (Q2014216) (← links)
- Maximal distance spectral radius of 4-chromatic planar graphs (Q2020654) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Modulo orientations and matchings in graphs (Q2138971) (← links)
- New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
- Complete graph-tree planar Ramsey numbers (Q2287756) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- On \(t\)-common list-colorings (Q2401414) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\) (Q2449102) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- A Five-Color Theorem for Graphs on Surfaces (Q3320404) (← links)
- QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS (Q4607003) (← links)
- (Q5206906) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- Graph theory (Q5917392) (← links)
- Acyclic colorings of planar graphs (Q5921616) (← links)
