A 4-choosable graph that is not (8:2)-choosable

DOI10.19086/AIC.10811zbMath1450.05074arXiv1806.03880OpenAlexW2807314195MaRDI QIDQ5126751

Xiaolan Hu, Jean-Sébastien Sereni, Zdeněk Dvořák

Publication date: 20 October 2020

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.03880

zbMATH Keywords

list coloring\((a:b)\)-choosable graph\((am:bm)\)-conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Multiple list coloring of 3‐choice critical graphs ⋮ The strong fractional choice number of series-parallel graphs ⋮ Multiple list colouring triangle free planar graphs

This page was built for publication: A 4-choosable graph that is not (8:2)-choosable