Pages that link to "Item:Q1405097"
From MaRDI portal
The following pages link to A sufficient condition for planar graphs to be 3-colorable (Q1405097):
Displayed 28 items.
- Steinberg's conjecture is false (Q345097) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← 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)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← links)
- (Q2857451) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES (Q3646205) (← links)
