Comparison of sum choice number with chromatic sum
From MaRDI portal
Publication:2032707
DOI10.1016/j.disc.2021.112391zbMath1475.05070OpenAlexW3154464501MaRDI QIDQ2032707
Massimiliano Marangio, Arnfried Kemnitz, Zsolt Tuza, Margit Voigt
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112391
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the sum choice number of a graph
- Sum list coloring \(2\times n\) arrays
- Sum list coloring block graphs
- Sum list colorings of wheels
- Contractions and minimal k-colorability
- Bounds for the sum choice number
- Sum list coloring graphs
- Choice Numbers of Graphs: a Probabilistic Approach