Pages that link to "Item:Q1405112"
From MaRDI portal
The following pages link to A short list color proof of Grötzsch's theorem (Q1405112):
Displaying 48 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Homomorphism bounds for oriented planar graphs of given minimum girth (Q367080) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- On 3-choosability of triangle-free plane graphs (Q657261) (← links)
- What is on his mind? (Q709300) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Nowhere-zero 3-flows in toroidal graphs (Q2072180) (← links)
- Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (Q2099419) (← links)
- On sufficient conditions for planar graphs to be 5-flexible (Q2117537) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- Flow extensions and group connectivity with applications (Q2198992) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- On spanning trees without vertices of degree 2 in plane triangulations (Q2202674) (← links)
- 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Group connectivity and group coloring: small groups versus large groups (Q2309219) (← links)
- Multiple list colouring triangle free planar graphs (Q2312604) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2851483) (← links)
- 3-Flows and Combs (Q2930042) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus (Q5875873) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Flexibility of triangle‐free planar graphs (Q6055413) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Nowhere-zero 3-flows in signed planar graphs (Q6574386) (← links)
