Lower bounds on the sum choice number of a graph

DOI10.1016/J.ENDM.2016.05.036zbMATH Open1347.05066OpenAlexW2508276897MaRDI QIDQ327690FDOQ327690

Authors: Jochen Harant, Arnfried Kemnitz 

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.036

Recommendations

• Bounds for the sum choice number
• Comparison of sum choice number with chromatic sum
• List colorings with distinct list sizes, the case of complete bipartite graphs
• Sum choice numbers of some graphs
• Sum list coloring graphs

zbMATH Keywords

coloringsum choice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Sum choice numbers of some graphs
• Sum list coloring graphs
• Graphs with many vertex-disjoint cycles
• Sum list coloring block graphs
• Sum list colorings of wheels

Cited In (4)

• Comparison of sum choice number with chromatic sum
• Title not available (Why is that?)
• Generalized sum List colorings of graphs
• Bounds for the sum choice number

This page was built for publication: Lower bounds on the sum choice number of a graph

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