Pages that link to "Item:Q1026007"
From MaRDI portal
The following pages link to Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007):
Displaying 35 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
- Steinberg's conjecture is false (Q345097) (← 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)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← 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)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Corrigendum to ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles'' (Q2450936) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← links)
- Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles (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)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings (Q4865526) (← links)
- Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)
- Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable (Q6606324) (← links)
