Pages that link to "Item:Q497344"

The following pages link to Distance constraints on short cycles for 3-colorability of planar graphs (Q497344):

Displaying 3 items.

• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)