Showing 2026 · cs.DSShow all
3 papers · 2 filters
cs.DS2026
Online Graph Coloring: Competitive Ratios Separating Randomized and Deterministic Algorithms
Ken-ichi Kawarabayashi, Hirotaka Yoneda, Masataka Yoneda
We study online coloring, focusing on the competitive ratio. The best previously known results were (1) a lower bound of for both deterministic and randomized alg…
cs.DS2026
The Balanced Four-Color Theorem
Ken-ichi Kawarabayashi, Hirotaka Yoneda, Masataka Yoneda
We show that every planar graph with vertices admits a 4-coloring in which each color is used on fewer than vertices. This bound is the best possible. Moreover, su…
cs.DS2026
Online Coloring for Graphs of Large Odd Girth
Hirotaka Yoneda, Masataka Yoneda
We study the problem of online coloring for graphs with large odd girth. The best previously known algorithm uses colors, which was discovered by Kierstead in 1998. Th…