Pages that link to "Item:Q3067058"

The following pages link to Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058):

Displaying 12 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)
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
• A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
• Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
• A relaxation of the Bordeaux conjecture (Q2349972) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• (Q2857451) (← links)