Sum choice numbers of some graphs

DOI10.1016/J.DISC.2008.04.044MaRDI QIDQ1025471zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The sum choice number of P₃ P_n
• Sum list coloring graphs
• Bounds for the sum choice number
• Sum choice number of generalized \(\theta\)-graphs
• Comparison of sum choice number with chromatic sum

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• Sum list coloring 2 n arrays
• Sum list coloring block graphs
• Sum list coloring graphs

Cited in

(12)

• Online sum-paintability: the slow-coloring game
• Comparison of sum choice number with chromatic sum
• Sum choice number of generalized \(\theta\)-graphs
• Bounds for the sum choice number
• Online sum-paintability: slow-coloring of trees
• Generalized sum List colorings of graphs
• List colorings with distinct list sizes, the case of complete bipartite graphs
• Lower bounds on the sum choice number of a graph
• The sum choice number of P₃ P_n
• Sum list coloring 2 n arrays
• Sum list coloring block graphs
• Sum list colorings of wheels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025471)