A note on fractional DP-coloring of graphs
From MaRDI portal
Publication:6570045
Recommendations
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)