Sum list colorings of wheels

DOI10.1007/s00373-015-1565-yzbMath1327.05111OpenAlexW1969055361MaRDI QIDQ897250

Massimiliano Marangio, Margit Voigt, Arnfried Kemnitz

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1565-y

zbMATH Keywords

choice functionlist coloringsum choice number\(sc\)-greedy

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Lower bounds on the sum choice number of a graph ⋮ Sum choice number of generalized \(\theta\)-graphs ⋮ Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common ⋮ Bounds for the sum choice number ⋮ The interactive sum choice number of graphs ⋮ Sum list edge colorings of graphs ⋮ Comparison of sum choice number with chromatic sum

Cites Work

• The sum choice number of \(P_3 \square P_n\)
• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• Sum choice numbers of some graphs
• Sum list coloring graphs
• List colorings with distinct list sizes, the case of complete bipartite graphs

This page was built for publication: Sum list colorings of wheels