Sum list coloring block graphs
From MaRDI portal
Publication:704844
DOI10.1007/S00373-004-0564-1zbMATH Open1053.05049OpenAlexW1964362533MaRDI QIDQ704844FDOQ704844
Authors: Garth Isaak 
Publication date: 20 January 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-004-0564-1
Recommendations
Cited In (26)
- Sum list coloring graphs
- On a list-coloring problem
- Sum-list-colouring of \(\theta \)-hypergraphs
- An infinite family of sum-paint critical graphs
- Sum choice number of generalized \(\theta\)-graphs
- The sum choice number of \(P_3 \square P_n\)
- Sum list coloring \(2\times n\) arrays
- Sum list edge colorings of graphs
- Acyclic sum-list-colouring of cylinders
- Comparison of sum choice number with chromatic sum
- The interactive sum choice number of graphs
- Lower bounds on the sum choice number of a graph
- On the \(\mathcal{P}\)-sum choice number of graphs for \(1\)-additive properties
- The interactive sum choice number of graphs
- Generalized sum List colorings of graphs
- Sum list colorings of wheels
- Sum choice numbers of some 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
- Improper sum-list colouring of 2-trees
- List colorings with distinct list sizes, the case of complete bipartite graphs
- Sum-paintability of generalized theta-graphs
- List colorings with distinct list sizes, the case of complete bipartite graphs
- Online sum-paintability: slow-coloring of trees
- Online sum-paintability: the slow-coloring game
- Families of online sum-choice-greedy graphs
This page was built for publication: Sum list coloring block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704844)
