On the P-sum choice number of graphs for 1-additive properties

MaRDI QIDQ4636175zbMATH OpenFDO

Authors Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt

Publication date 23 April 2018

zbMATH Keywords

generalized sum list coloringgraph propertysum choice numbersum list coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Generalized sum List colorings of graphs
• Sum list coloring graphs
• scientific article; zbMATH DE number 1536522
• Sum list coloring block graphs
• Generalized chromatic numbers and additive hereditary properties of graphs

Cited in

(3)

• 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
• Generalized sum List colorings of graphs

This page was built for publication: On the \(\mathcal{P}\)-sum choice number of graphs for \(1\)-additive properties

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