Sum list coloring 2 n arrays
From MaRDI portal
Publication:698613
zbMATH Open1003.05041MaRDI QIDQ698613FDOQ698613
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (26)
- Sum list coloring graphs
- Slow coloring of \(3k\)-connected graphs
- Acyclic sum-list-colouring of grids and other classes of graphs
- Title not available (Why is that?)
- 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 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
- Sum list coloring block graphs
- 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
- Sum-list-colouring of θ-hypergraphs
- 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 \(2\times n\) arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698613)
