The following pages link to Steinberg's conjecture is false (Q345097):
Displaying 49 items.
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Circular backbone colorings: on matching and tree backbones of planar graphs (Q1627845) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← links)
- New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- Gaps in the cycle spectrum of 3-connected cubic planar graphs (Q2221919) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)
- A Steinberg-like approach to describing faces in 3-polytopes (Q2361077) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
- Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
- Steinberg-like theorems for backbone colouring (Q5916058) (← links)
- Backbone coloring of graphs with galaxy backbones (Q5918549) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)
- (Q6072056) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
- Fractional coloring planar graphs under Steinberg-type conditions (Q6113758) (← links)
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- (Q6189392) (← links)