Generalized sum List colorings of graphs

DOI10.7151/dmgt.2174zbMath1441.05079OpenAlexW2898287557WikidataQ129035645 ScholiaQ129035645MaRDI QIDQ2416953

Massimiliano Marangio, Arnfried Kemnitz, Margit Voigt

Publication date: 27 May 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2174

zbMATH Keywords

sum choice numbersum list coloringadditive hereditary graph propertygeneralized sum list coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common ⋮ Improper sum-list colouring of 2-trees

Cites Work

• Lower bounds on the sum choice number of a graph
• Sum list coloring \(2\times n\) arrays
• Sum list coloring block graphs
• Sum choice number of generalized \(\theta\)-graphs
• Bounds for the sum choice number
• Sum list coloring graphs
• A survey of hereditary properties of graphs
• Acyclic sum-list-colouring of grids and other classes of graphs
• General and acyclic sum-list-colouring of graphs
• Unnamed Item