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 7 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• Triangle decompositions of planar graphs (Q726643) (← links)
• Decomposing a planar graph into degenerate graphs (Q1907105) (← links)
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
• Decompositions of quadrangle-free planar graphs (Q5324105) (← links)
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)