Slow coloring of \(3k\)-connected graphs

DOI10.1016/j.dam.2023.12.001zbMath1530.05128arXiv2304.01368OpenAlexW4389775190MaRDI QIDQ6145826

Joan M. Morris

Publication date: 9 January 2024

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

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

zbMATH Keywords

coloringonline sum-paintabilityslow coloringsum-color cost

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sum-paintability of generalized theta-graphs
• Sum list coloring \(2\times n\) arrays
• Online sum-paintability: the slow-coloring game
• The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Online sum-paintability: slow-coloring of trees
• Graph colorings with local constraints -- a survey

This page was built for publication: Slow coloring of \(3k\)-connected graphs