Pages that link to "Item:Q5486272"
From MaRDI portal
The following pages link to Improper choosability of graphs and maximum average degree (Q5486272):
Displaying 46 items.
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- 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)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- On generalized choice and coloring numbers (Q1733934) (← 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)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← 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)
- 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)
- 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)
- Defective 2-colorings of sparse graphs (Q2434717) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← 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)
- Vertex Partitions of Graphs into Cographs and Stars (Q2874091) (← 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)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
- (Q3304104) (← 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)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- (Q5878782) (← 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)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)