Sum choice numbers of some graphs

DOI10.1016/J.DISC.2008.04.044zbMath1198.05052OpenAlexW2090448654MaRDI QIDQ1025471

Brian Heinold

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.044

zbMATH Keywords

graph coloringlist coloringsum choice numbersum list coloring

Mathematics Subject Classification ID

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

Related Items (7)

Lower bounds on the sum choice number of a graph ⋮ Sum choice number of generalized \(\theta\)-graphs ⋮ Online sum-paintability: slow-coloring of trees ⋮ Sum list colorings of wheels ⋮ The sum choice number of \(P_3 \square P_n\) ⋮ Online sum-paintability: the slow-coloring game ⋮ List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs

Cites Work

• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• Sum list coloring graphs
• Unnamed Item

This page was built for publication: Sum choice numbers of some graphs