Sum list coloring graphs
From MaRDI portal
Publication:2502028
DOI10.1007/s00373-005-0645-9zbMath1098.05027OpenAlexW2077074612MaRDI QIDQ2502028
Louis Deaett, Ulrike Bostelmann, Adam H. Berliner, Richard A. Brualdi
Publication date: 12 September 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0645-9
Related Items
Lower bounds on the sum choice number of a graph ⋮ 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 ⋮ 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 ⋮ 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 ⋮ List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs ⋮ Sum choice numbers of some graphs ⋮ List colorings with distinct list sizes, the case of complete bipartite graphs
Cites Work
This page was built for publication: Sum list coloring graphs
