Fractional DP-chromatic number of planar graphs of large girth
From MaRDI portal
Publication:5063294
DOI10.1142/S1793830921501111zbMath1482.05124OpenAlexW3135708851MaRDI QIDQ5063294
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501111
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Choosability and fractional chromatic numbers
- List coloring a Cartesian product with a complete bipartite factor
- Fractional DP‐colorings of sparse graphs
- Circular chromatic number of planar graphs of large odd girth
This page was built for publication: Fractional DP-chromatic number of planar graphs of large girth