A sufficient condition for DP-4-colorability

DOI10.1016/j.disc.2018.03.027zbMath1387.05091arXiv1709.09809OpenAlexW2963837184WikidataQ129782086 ScholiaQ129782086MaRDI QIDQ1752670

Seog-Jin Kim, Kenta Ozeki

Publication date: 24 May 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

signed graphcoloringlist-coloringDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (29)

DP-3-coloring of some planar graphs ⋮ Upper bound for DP-chromatic number of a graph ⋮ Coloring permutation-gain graphs ⋮ Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate ⋮ Partial DP-coloring of graphs ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ Planar graphs without intersecting 5-cycles are signed-4-choosable ⋮ On colorings and orientations of signed graphs ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Asymptotically good edge correspondence colourings ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Variable degeneracy on toroidal graphs ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ Unnamed Item ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Answers to two questions on the DP color function ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable ⋮ DP-coloring on planar graphs without given adjacent short cycles

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs without cycles of specific lengths
• Choosability in signed planar graphs
• The chromatic number of a signed graph
• Signed graph coloring
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and edge choosability of planar graphs without five cycles
• A not 3-choosable planar graph without 3-cycles
• On DP-coloring of graphs and multigraphs
• DP-colorings of graphs with high chromatic number
• The chromatic spectrum of signed graphs
• The asymptotic behavior of the correspondence chromatic number
• Sharp Dirac's theorem for DP‐critical graphs
• Circular coloring of signed graphs
• A note on a Brooks' type theorem for DP‐coloring

This page was built for publication: A sufficient condition for DP-4-colorability