Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
From MaRDI portal
Publication:2084793
DOI10.1007/s00373-022-02575-yzbMath1504.05103arXiv2201.12028OpenAlexW4304690601MaRDI QIDQ2084793
Publication date: 13 October 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.12028
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Multiple list colouring of planar graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Choosability and fractional chromatic numbers
- Planar graphs are \(9/2\)-colorable
- Multiple list colouring triangle free planar graphs
- Every planar graph is 1-defective \((9,2)\)-paintable
- Fractional DP‐colorings of sparse graphs
This page was built for publication: Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles