Pages that link to "Item:Q2461207"
From MaRDI portal
The following pages link to On 3-colorable planar graphs without prescribed cycles (Q2461207):
Displaying 5 items.
- On 3-colorable planar graphs without short cycles (Q998606) (← 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)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
