Sum list coloring 2 n arrays
From MaRDI portal
Recommendations
Cited in
(26)- List colorings with distinct list sizes, the case of complete bipartite graphs
- Acyclic sum-list-colouring of grids and other classes of graphs
- Comparison of sum choice number with chromatic sum
- Sum choice number of generalized \(\theta\)-graphs
- The sum choice number of \(P_3 \square P_n\)
- scientific article; zbMATH DE number 7637228 (Why is no real title available?)
- Sum list coloring graphs
- Acyclic sum-list-colouring of cylinders
- Generalized sum List colorings of graphs
- Slow coloring of \(3k\)-connected graphs
- Sum-list-colouring of \(\theta \)-hypergraphs
- Sum list coloring block graphs
- Sum choice numbers of some graphs
- Families of online sum-choice-greedy graphs
- Online sum-paintability: slow-coloring of trees
- Online sum-paintability: the slow-coloring game
- Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
- Sum list edge colorings of graphs
- An infinite family of sum-paint critical graphs
- The interactive sum choice number of graphs
- Bounds for the sum choice number
- Sum-paintability of generalized theta-graphs
- Sum list colorings of wheels
- The interactive sum choice number of 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698613)
