Online sum-paintability: slow-coloring of trees
From MaRDI portal
Publication:2416431
DOI10.1016/j.dam.2019.02.003zbMath1411.05184arXiv1612.04702OpenAlexW2963531387WikidataQ128228710 ScholiaQ128228710MaRDI QIDQ2416431
Gregory J. Puleo, Douglas B. West
Publication date: 23 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.04702
2-person games (91A05) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Slow coloring of \(3k\)-connected graphs ⋮ The interactive sum choice number of graphs ⋮ The interactive sum choice number of graphs
Cites Work
- The sum choice number of \(P_3 \square P_n\)
- Sum-paintability of generalized theta-graphs
- Sum list coloring \(2\times n\) arrays
- Sum list coloring block graphs
- Families of online sum-choice-greedy graphs
- Sum choice numbers of some graphs
- Online sum-paintability: the slow-coloring game
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Sum list coloring graphs
- The interactive sum choice number of graphs