DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
type: Item
instance of: scholarly article
title: DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
zbMATH Open document ID: 1416.05113
author: Runrun Liu
author: Sarah Loeb
author: Martin Rolek
author: Yuxue Yin
author: Gexin Yu
published in: Graphs and Combinatorics
publication date: 2019-06-28T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7074922
zbMATH Keywords: DP-3-coloring
zbMATH Keywords: planar graphs
zbMATH Keywords: discharging
zbMATH Keywords: list coloring
MaRDI profile type: Publication
full work available at URL: s00373-019-02025-2
OpenAlex ID: W2921745586
cites work: Colorings and orientations of graphs
cites work: Sharp Dirac's theorem for DP‐critical graphs
cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
cites work: Q3922703
cites work: Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
cites work: DP-3-coloring of some planar graphs
cites work: A note on a Brooks' type theorem for DP‐coloring
cites work: Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
cites work: A sufficient condition for a planar graph to be 3-choosable
cites work: Every planar graph is 5-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
cites work: A note on 3-choosability of planar graphs
cites work: Q4135588
cites work: Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
DOI: 10.1007/S00373-019-02025-2
description: scientific article; zbMATH DE number 7074922