List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs

DOI10.1002/jgt.21896zbMath1339.05132OpenAlexW2623096099MaRDI QIDQ2811205

Ida Kantor, Zoltan Fueredi

Publication date: 10 June 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/44189/2/2385.pdf

zbMATH Keywords

list chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Proportional choosability of complete bipartite graphs ⋮ Bounds for the sum choice number ⋮ The interactive sum choice number of graphs ⋮ The interactive sum choice number of graphs

Cites Work

• The sum choice number of \(P_3 \square P_n\)
• List colourings of planar graphs
• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• Sum choice numbers of some graphs
• Every planar graph is 5-choosable
• Sum list coloring graphs
• Unnamed Item

This page was built for publication: List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs