Improper choosability of graphs and maximum average degree
From MaRDI portal
Recommendations
- List Improper Colourings of Planar Graphs
- List improper colorings of planar graphs with prescribed girth
- 8-star-choosability of a graph with maximum average degree less than 3
- Improper choosability of planar graphs without 4-cycles
- Choosability of the square of a planar graph with maximum degree four
- Acyclic 3-choosability of sparse graphs with girth at least 7
- The List L(2, 1)-labeling of planar graphs
- List colourings of planar graphs
- Acyclic improper choosability of graphs
- 3-choosability of triangle-free planar graphs with constraints on 4-cycles
Cited in
(57)- Improper choosability of graphs embedded on the surface of genus r
- Path choosability of planar graphs
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- On generalized choice and coloring numbers
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- \(k\)-forested choosability of graphs with bounded maximum average degree
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Acyclic improper choosability of subcubic graphs
- Maximum average degree and relaxed coloring
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- Every planar graph with girth at least 5 is (1,9)-colorable
- Colouring planar graphs with bounded monochromatic components
- On 2-defective DP-colorings of sparse graphs
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- Near-colorings: non-colorable graphs and NP-completeness
- On the vertex partition of planar graphs into forests with bounded degree
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Total weight choosability of graphs with bounded maximum average degree
- Defective 2-colorings of sparse graphs
- Improper colouring of (random) unit disk graphs
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- Improper coloring of sparse graphs with a given girth. II: Constructions
- Vertex partitions of graphs into cographs and stars
- Limits of near-coloring of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- List strong linear 2-arboricity of sparse graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- Parameterized (approximate) defective coloring
- On 1-improper 2-coloring of sparse graphs
- Decomposition of sparse graphs into two forests, one having bounded maximum degree
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Planar graphs with girth at least 5 are (3, 5)-colorable
- Splitting planar graphs of girth 6 into two linear forests with short paths
- An introduction to the discharging method via graph coloring
- Parameterized (approximate) defective coloring
- Defective and clustered choosability of sparse graphs
- Improper choosability and property B
- Defective Coloring on Classes of Perfect Graphs
- Partitioning planar graphs with girth at least 6 into bounded size components
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Sparse critical graphs for defective DP-colorings
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable
- Sparse critical graphs for defective (1, 3)-coloring
- An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6
- Every planar graph without 4- and 6-cycles is (2,5)-colorable
- Defective and clustered colouring of graphs with given girth
This page was built for publication: Improper choosability of graphs and maximum average degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486272)
