Bounds for the sum choice number
From MaRDI portal
Publication:2413335
DOI10.1016/j.endm.2017.10.061zbMath1383.05104OpenAlexW2773425494MaRDI QIDQ2413335
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt
Publication date: 10 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.061
Related Items (4)
Generalized sum List colorings of graphs ⋮ The interactive sum choice number of graphs ⋮ Sum list edge colorings of graphs ⋮ Comparison of sum choice number with chromatic sum
Cites Work
- Lower bounds on the sum choice number of a graph
- Sum-paintability of generalized theta-graphs
- Sum list coloring \(2\times n\) arrays
- Sum list coloring block graphs
- Sum list edge colorings of graphs
- Sum list colorings of wheels
- Sum choice number of generalized \(\theta\)-graphs
- Sum list coloring graphs
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds for the sum choice number
