Lower bounds on the sum choice number of a graph
From MaRDI portal
Publication:327690
DOI10.1016/J.ENDM.2016.05.036zbMath1347.05066OpenAlexW2508276897MaRDI QIDQ327690
Jochen Harant, Arnfried Kemnitz
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.036
Related Items (3)
Bounds for the sum choice number ⋮ Generalized sum List colorings of graphs ⋮ Comparison of sum choice number with chromatic sum
Cites Work
This page was built for publication: Lower bounds on the sum choice number of a graph