Abstract
The slow-coloring game is played by Lister and Painter on a graph G. In each round, Lister marks a nonempty subset M of the remaining vertices, scoring M points. Painter then gives a color to a subset of M that is independent in G. The game ends when all vertices are colored. Painter’s goal is to minimize the total score; Lister seeks to maximize it. The score that each player can guarantee doing no worse than is the sum-color cost of G, written s̊(G). We develop a linear-time algorithm to compute s̊(G) when G is a tree, enabling us to characterize the n-vertex trees with the largest and smallest values. Our algorithm also computes on trees the interactive sum choice number, a parameter recently introduced by Bonamy and Meeks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
