Pages that link to "Item:Q1931401"

The following pages link to A step towards the strong version of Havel's three color conjecture (Q1931401):

Displaying 2 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)