Pages that link to "Item:Q2260631"

The following pages link to Near-colorings: non-colorable graphs and NP-completeness (Q2260631):

Displaying 33 items.

• Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
• 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)
• Maximum average degree and relaxed coloring (Q2012543) (← 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)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← 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)
• 2-subcoloring is NP-complete for planar comparability graphs (Q2404616) (← links)
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
• (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
• (Q5878782) (← links)
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
• Path partition of planar graphs with girth at least six (Q6059078) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)
• Partitioning planar graph of girth 5 into two forests with maximum degree 4. (Q6584423) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
• A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable (Q6585548) (← links)
• Planar graphs without cycles of length 3, 4, and 6 are (3, 3)-colorable (Q6657759) (← links)