Pages that link to "Item:Q2379960"
From MaRDI portal
The following pages link to On 3-colorable planar graphs without cycles of four lengths (Q2379960):
Displaying 18 items.
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
- (Q4797465) (← links)
