On DP-coloring of outerplanar graphs

DOI10.1016/J.DISC.2026.114996MaRDI QIDQ6846068zbMATH OpenFDO

Authors Tianjiao Dai, Jie Hu, Hao Li, Shun-ichi Maezawa

Publication date 12 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.114996

zbMATH Keywords

2-connected outerplanar graphsDP-coloringDP-degree-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Relations of low-dimensional topology with graph theory (57M15)

Cites work

• 3-list-coloring planar graphs of girth 5
• A note on a Brooks' type theorem for DP-coloring
• Colorings and orientations of graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Every planar graph is 5-choosable
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 1496580 (Why is no real title available?)
• On DP-coloring of graphs and multigraphs
• On list-coloring outerplanar graphs
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• The asymptotic behavior of the correspondence chromatic number
• The colour theorems of Brooks and Gallai extended

This page was built for publication: On DP-coloring of outerplanar graphs

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