Pages that link to "Item:Q859619"
From MaRDI portal
The following pages link to On 3-colorable plane graphs without 5- and 7-cycles (Q859619):
Displayed 23 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← 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)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- On 3-colorable planar graphs without prescribed cycles (Q2461207) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← 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)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)