A note on fractional DP-coloring of graphs

DOI10.1016/J.DISC.2024.114123zbMATH Open1543.05052MaRDI QIDQ6570045FDOQ6570045

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

Publication date: 10 July 2024

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

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

zbMATH Keywords

graph coloringlist coloringfractional coloringcorrespondence coloringDP-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some results on \((a:b)\)-choosability
• Choosability and fractional chromatic numbers
• Title not available (Why is that?)
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• A note on the DP-chromatic number of complete bipartite graphs
• Fractional DP-colorings of sparse graphs
• A 4-choosable graph that is not \((8:2)\)-choosable

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)