Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions

DOI10.1002/jgt.21886zbMath1333.05115OpenAlexW1898230612MaRDI QIDQ2800597

Xuding Zhu, Jae-Hoon Kim, Alexandr V. Kostochka

Publication date: 15 April 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21886

zbMATH Keywords

girthsparse graphimproper coloringdefective coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (13)

Unnamed Item ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs ⋮ Parameterized (Approximate) Defective Coloring ⋮ Graph partitions under average degree constraint ⋮ Sparse critical graphs for defective DP-colorings ⋮ Fashion game on graphs ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Defective and clustered choosability of sparse graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Defective Coloring on Classes of Perfect Graphs

Cites Work

• Unnamed Item
• On 1-improper 2-coloring of sparse graphs
• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
• Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
• Defective 2-colorings of sparse graphs
• Path partitions of planar graphs
• Limits of Near-Coloring of Sparse Graphs
• Globally sparse vertex‐ramsey graphs
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• Improper choosability of graphs and maximum average degree
• On chromatic number of graphs and set-systems

This page was built for publication: Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions