Sum list coloring \(2\times n\) arrays

zbMath1003.05041MaRDI QIDQ698613

Garth Isaak

Publication date: 22 September 2002

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122307

zbMATH Keywords

sum choice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (25)

Sum-list-colouring of θ-hypergraphs ⋮ Sum choice number of generalized \(\theta\)-graphs ⋮ Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common ⋮ Bounds for the sum choice number ⋮ Online sum-paintability: slow-coloring of trees ⋮ Generalized sum List colorings of graphs ⋮ Families of online sum-choice-greedy graphs ⋮ Sum list colorings of wheels ⋮ Slow coloring of \(3k\)-connected graphs ⋮ The sum choice number of \(P_3 \square P_n\) ⋮ Online sum-paintability: the slow-coloring game ⋮ An infinite family of sum-paint critical graphs ⋮ Sum-paintability of generalized theta-graphs ⋮ Acyclic sum-list-colouring of cylinders ⋮ Unnamed Item ⋮ Sum list coloring graphs ⋮ The interactive sum choice number of graphs ⋮ The interactive sum choice number of graphs ⋮ Sum list edge colorings of graphs ⋮ Comparison of sum choice number with chromatic sum ⋮ Acyclic sum-list-colouring of grids and other classes of graphs ⋮ List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs ⋮ Sum choice numbers of some graphs ⋮ Improper sum-list colouring of 2-trees ⋮ List colorings with distinct list sizes, the case of complete bipartite graphs

This page was built for publication: Sum list coloring \(2\times n\) arrays