Improper choosability of graphs and maximum average degree
From MaRDI portal
Publication:5486272
DOI10.1002/jgt.20155zbMath1104.05026OpenAlexW4251451573MaRDI QIDQ5486272
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
Related Items (46)
A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable ⋮ Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ Path choosability of planar graphs ⋮ Defective 2-colorings of planar graphs without 4-cycles and 5-cycles ⋮ Unnamed Item ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Improper Choosability and Property B ⋮ Colouring planar graphs with bounded monochromatic components ⋮ On 1-improper 2-coloring of sparse graphs ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ \((k,1)\)-coloring of sparse graphs ⋮ Parameterized (Approximate) Defective Coloring ⋮ \((k,j)\)-coloring of sparse graphs ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Sparse critical graphs for defective DP-colorings ⋮ Unnamed Item ⋮ Defective 2-colorings of sparse graphs ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ On generalized choice and coloring numbers ⋮ Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 ⋮ Planar graphs with girth at least 5 are \((3, 5)\)-colorable ⋮ List strong linear 2-arboricity of sparse graphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ Improper colouring of (random) unit disk graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ Acyclic improper choosability of subcubic graphs ⋮ Maximum average degree and relaxed coloring ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions ⋮ On the vertex partition of planar graphs into forests with bounded degree ⋮ Defective and clustered choosability of sparse graphs ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ Planar graphs with girth at least 5 are \((3, 4)\)-colorable ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ Defective Coloring on Classes of Perfect Graphs ⋮ Vertex Partitions of Graphs into Cographs and Stars ⋮ Limits of Near-Coloring of Sparse Graphs
This page was built for publication: Improper choosability of graphs and maximum average degree
