Improper choosability of graphs and maximum average degree
From MaRDI portal
Publication:5486272
DOI10.1002/JGT.20155zbMATH Open1104.05026OpenAlexW4251451573MaRDI QIDQ5486272FDOQ5486272
Authors: Frédéric Havet, Jean-Sébastien Sereni 
Publication date: 6 September 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00071425/file/RR-5164.pdf
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 (52)
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- Improper choosability of graphs embedded on the surface of genus \(r\)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Near-colorings: non-colorable graphs and NP-completeness
- Improper colouring of (random) unit disk graphs
- Improper choosability and property B
- On generalized choice and coloring numbers
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- Decomposition of sparse graphs into two forests, one having bounded maximum degree
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Acyclic improper choosability of subcubic graphs
- Maximum average degree and relaxed coloring
- Path choosability of planar graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Defective Coloring on Classes of Perfect Graphs
- Vertex partitions of graphs into cographs and stars
- On 1-improper 2-coloring of sparse graphs
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- On 2-defective DP-colorings of sparse graphs
- Parameterized (approximate) defective coloring
- On the vertex partition of planar graphs into forests with bounded degree
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Defective 2-colorings of sparse graphs
- Parameterized (approximate) defective coloring
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- Improper coloring of sparse graphs with a given girth. II: Constructions
- List strong linear 2-arboricity of sparse graphs
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
- Partitioning planar graphs with girth at least 6 into bounded size components
- Sparse critical graphs for defective DP-colorings
- Every planar graph with girth at least 5 is \((1,9)\)-colorable
- Limits of near-coloring of sparse graphs
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Defective and clustered choosability of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Colouring planar graphs with bounded monochromatic components
- Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
- Total weight choosability of graphs with bounded maximum average degree
- An introduction to the discharging method via graph coloring
- \(k\)-forested choosability of graphs with bounded maximum average degree
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- 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
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)
