Pages that link to "Item:Q488297"

The following pages link to Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297):

Displaying 15 items.

• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
• Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
• Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
• Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
• Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
• Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
• On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• (Q5878782) (← links)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)