Pages that link to "Item:Q2274084"

The following pages link to Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084):

Displaying 2 items.

• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)