Multiple list colouring triangle free planar graphs
From MaRDI portal
Publication:2312604
DOI10.1016/j.jctb.2018.12.004zbMath1416.05107arXiv1809.03665OpenAlexW2963913562WikidataQ128784937 ScholiaQ128784937MaRDI QIDQ2312604
Publication date: 17 July 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.03665
fractional choice numbermultiple list colouringstrong fractional choice numbertriangle free planar graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ The strong fractional choice number of 3‐choice‐critical graphs ⋮ Multiple list coloring of 3‐choice critical graphs ⋮ The strong fractional choice number of series-parallel graphs ⋮ Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
Cites Work
- Unnamed Item
- Multiple list colouring of planar graphs
- A note on the not 3-choosability of some families of planar graphs
- Fractional coloring of triangle-free planar graphs
- Choosability and fractional chromatic numbers
- A short list color proof of Grötzsch's theorem
- Smaller planar triangle-free graphs that are not 3-list-colorable
- A not 3-choosable planar graph without 3-cycles
- A 4-choosable graph that is not (8:2)-choosable
This page was built for publication: Multiple list colouring triangle free planar graphs