The game colouring number of powers of forests
Stephan Dominique Andres, Winfried Hochst\"attler

TL;DR
This paper establishes a new upper bound for the game colouring number of powers of forests, significantly improving previous bounds and contributing to graph theory and combinatorics.
Contribution
It provides a tighter upper bound for the game colouring number of powers of forests, advancing understanding in graph coloring theory.
Findings
New upper bound for game colouring number of powers of forests
Improvement over previous bounds by an asymptotic factor of 2
Applicable for forests with maximum degree at least 3
Abstract
We prove that the game colouring number of the -th power of a forest of maximum degree is bounded from above by \[\frac{(\Delta-1)^m-1}{\Delta-2}+2^m+1,\] which improves the best known bound by an asymptotic factor of 2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
