Pages that link to "Item:Q1931401"
From MaRDI portal
The following pages link to A step towards the strong version of Havel's three color conjecture (Q1931401):
Displayed 4 items.
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)