Pages that link to "Item:Q2434717"

The following pages link to Defective 2-colorings of sparse graphs (Q2434717):

Displaying 36 items.

• On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← 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)
• A Brooks-type result for sparse critical graphs (Q1786052) (← 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)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← 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 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
• Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
• Defective DP-colorings of sparse simple graphs (Q2237221) (← 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)
• 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)
• 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)
• Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597) (← 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)
• Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← links)
• Note on improper coloring of $1$-planar graphs (Q5206449) (← links)
• Defective and clustered choosability of sparse graphs (Q5222556) (← 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)
• 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)
• Graph partitions under average degree constraint (Q6187347) (← links)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)