Pages that link to "Item:Q2978189"

The following pages link to (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189):

Displaying 12 items.

• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← 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)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
• Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)