Pages that link to "Item:Q2021579"

The following pages link to Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579):

Displaying 5 items.

• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
• Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
• Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)