Pages that link to "Item:Q3055928"

The following pages link to Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928):

Displaying 30 items.

• On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
• Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
• \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
• \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
• Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
• Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← 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)
• Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
• Colouring planar graphs with bounded monochromatic components (Q2182229) (← 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)
• 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)
• Defective 2-colorings of sparse graphs (Q2434717) (← links)
• Limits of Near-Coloring of Sparse Graphs (Q2874099) (← links)
• (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
• List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
• Fractional, Circular, and Defective Coloring of Series-Parallel Graphs (Q3466361) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
• Vertex Partitions into an Independent Set and a Forest with Each Component Small (Q5009333) (← 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)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)