Pages that link to "Item:Q1338317"
From MaRDI portal
The following pages link to Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane (Q1338317):
Displaying 46 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Group connectivity of bridged graphs (Q354436) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- What is on his mind? (Q709300) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Rainbowness of cubic plane graphs (Q856887) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- Nowhere-zero 3-flows in triangularly connected graphs (Q958692) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- The chromatic number of a graph of girth 5 on a fixed surface (Q1403910) (← links)
- A short list color proof of Grötzsch's theorem (Q1405112) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Graph imperfection. I (Q1850556) (← links)
- Three-coloring Klein bottle graphs of girth five (Q1880794) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Proper colorings of plane quadrangulations without rainbow faces (Q2051893) (← links)
- Nowhere-zero 3-flows in toroidal graphs (Q2072180) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Flow extensions and group connectivity with applications (Q2198992) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- Coloring near-quadrangulations of the cylinder and the torus (Q2225450) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← 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)
- Folding (Q2498742) (← links)
- Characterization of 4-critical triangle-free toroidal graphs (Q2668022) (← links)
- Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- EVERY N<sub>2</sub>-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z<sub>3</sub>-CONNECTED (Q3087095) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- Rainbowness of plane graphs (Q3439574) (← links)
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus (Q5875873) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
