Pages that link to "Item:Q977289"

The following pages link to On 3-colorability of planar graphs without adjacent short cycles (Q977289):

Displaying 13 items.

• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
• Class I graphs of nonnegative characteristic without special cycles (Q377914) (← links)
• Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← 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 planar graphs without short cycles (Q998606) (← links)
• Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
• A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
• On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• (Q4797465) (← links)