Online sum-paintability: the slow-coloring game

DOI10.1016/j.disc.2018.01.001zbMath1380.05131arXiv1507.06513MaRDI QIDQ1699554

Douglas B. West, Thomas Mahoney, Gregory J. Puleo

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06513

zbMATH Keywords

complete bipartite graph; Hall ratio; slow-coloring game; sum choosability; sum paintability

Mathematics Subject Classification ID

91A05: 2-person games

91A43: Games involving graphs

05C15: Coloring of graphs and hypergraphs

05C57: Games on graphs (graph-theoretic aspects)

Related Items

The independence coloring game on graphs, The interactive sum choice number of graphs, The interactive sum choice number of graphs, Slow coloring of \(3k\)-connected graphs, Online sum-paintability: the slow-coloring game, Online sum-paintability: slow-coloring of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Sum choice numbers of some graphs
• On the ultimate lexicographic Hall-ratio
• The fractional chromatic number, the Hall ratio, and the lexicographic product
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
• Online sum-paintability: the slow-coloring game
• The chromatic sum of a graph: history and recent developments
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Asymptotic values of the Hall-ratio for graph powers
• Hall ratio of the Mycielski graphs
• Sum list coloring graphs
• List colorings with distinct list sizes, the case of complete bipartite graphs
• Cliques in random graphs
• The chromatic number of random graphs