A note on fractional DP-coloring of graphs

DOI10.1016/J.DISC.2024.114123MaRDI QIDQ6570045zbMATH OpenFDO

Authors Daniel Dominik, Hemanshu Kaul, J. A. Mudrock

Publication date 10 July 2024

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph coloringlist coloringfractional coloringcorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Fractional DP-colorings of sparse graphs
• A note on the DP-chromatic number of complete bipartite graphs
• DP-colorings of graphs with high chromatic number
• On DP-coloring of graphs and multigraphs
• DP‐coloring Cartesian products of graphs

Cites work

• 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 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 908794 (Why is no real title available?)
• A 4-choosable graph that is not \((8:2)\)-choosable
• A note on the DP-chromatic number of complete bipartite graphs
• Choosability and fractional chromatic numbers
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Fractional DP-colorings of sparse graphs
• Some results on \((a:b)\)-choosability

This page was built for publication: A note on fractional DP-coloring of graphs

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