Pages that link to "Item:Q1690217"

The following pages link to Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217):

Displaying 9 items.

• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
• 不含3圈和4圈的1-平面图是5-可染的 (Q3131939) (← links)
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)