Defective DP-colorings of sparse multigraphs

DOI10.1016/J.EJC.2020.103267MaRDI QIDQ2225451zbMATH OpenOpenAlexFDO

Authors Yifan Jing, Fuhong Ma, Pongpat Sittitrai, Jingwei Xu, Alexandr Kostochka

Publication date 8 February 2021

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.03421

zbMATH Keywords

correspondence coloring\(n\)-vertex \((i,j)\)-critical multigraph

Mathematics Subject Classification ID

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

Abstract: DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i,j)$-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider $f_{DP}(i,j,n)$ --- the minimum number of edges that may have an $n$-vertex $(i,j)$-critical multigraph, that is, a multigraph $G$ that has no $(i,j)$-defective DP-coloring but whose every proper subgraph has such a coloring. For every $i$ and $j$, we find linear lower bounds on $f_{DP}(i,j,n)$ that are exact for infinitely many $n$.

Recommendations

• Defective DP-colorings of sparse simple graphs
• On 2-defective DP-colorings of sparse graphs
• On DP-coloring of graphs and multigraphs
• Fractional DP-colorings of sparse graphs
• DP-colorings of graphs with high chromatic number

Cites work

• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• A note on defective colorings of graphs in surfaces
• A relative of Hadwiger's conjecture
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Defective 2-colorings of sparse graphs
• Defective and clustered choosability of sparse graphs
• Defective and clustered graph colouring
• Defective choosability of graphs in surfaces
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Defective colouring of graphs excluding a subgraph or minor
• Improper choosability of graphs and maximum average degree
• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
• Improper coloring of sparse graphs with a given girth. II: Constructions
• Improper colourings inspired by Hadwiger's conjecture
• Limits of near-coloring of sparse graphs
• List Improper Colourings of Planar Graphs
• List improper colorings of planar graphs with prescribed girth
• Maximum average degree and relaxed coloring
• On 1-improper 2-coloring of sparse graphs
• On DP-coloring of graphs and multigraphs
• Planar graphs are 1-relaxed, 4-choosable
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
• Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
• \((k,1)\)-coloring of sparse graphs
• \((k,j)\)-coloring of sparse graphs

Cited in

(10)

• Sharp Dirac's theorem for DP-critical graphs
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
• On 2-defective DP-colorings of sparse graphs
• On DP-coloring of graphs and multigraphs
• Decomposing planar graphs into graphs with degree restrictions
• A weak DP-coloring of planar graphs without 4- and 9-cycles
• Sparse critical graphs for defective DP-colorings
• Fractional DP-colorings of sparse graphs
• Relaxed DP-3-coloring of planar graphs without some cycles
• Defective DP-colorings of sparse simple graphs

This page was built for publication: Defective DP-colorings of sparse multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225451)