List colorings with distinct list sizes, the case of complete bipartite graphs

DOI10.1016/j.endm.2009.07.053zbMath1273.05192arXiv1111.0234OpenAlexW1993542584MaRDI QIDQ2851483

Ida Kantor, Zoltan Fueredi

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graphslist chromatic number

Mathematics Subject Classification ID

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

Related Items (3)

Sum list colorings of wheels ⋮ The sum choice number of \(P_3 \square P_n\) ⋮ Online sum-paintability: the slow-coloring game

Cites Work

• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• A short list color proof of Grötzsch's theorem
• Sum list coloring graphs
• Unnamed Item

This page was built for publication: List colorings with distinct list sizes, the case of complete bipartite graphs