Pages that link to "Item:Q2461207"

The following pages link to On 3-colorable planar graphs without prescribed cycles (Q2461207):

Displaying 15 items.

• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
• Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs (Q793751) (← links)
• Three-coloring planar graphs without short cycles (Q845915) (← links)
• On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
• 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)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
• On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
• (Q4797465) (← links)
• (Q5699440) (← links)