Game chromatic index of graphs with given restrictions on degrees

DOI10.1016/j.tcs.2008.05.026zbMath1151.91029OpenAlexW2285730933WikidataQ57401479 ScholiaQ57401479MaRDI QIDQ954995

Andrew Beveridge, Oleg Pikhurko, Tom Bohman, Alan M. Frieze

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.026

zbMATH Keywords

Edge coloring on graphsGame chromatic indexGames on graphsRandom strategies

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The game chromatic index of wheels ⋮ A note on the game chromatic index of graphs ⋮ A new upper bound on the game chromatic index of graphs

Cites Work

• A note on the game chromatic index of graphs
• Randomization, derandomization and antirandomization: Three games
• Note on the game chromatic index of trees
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• Game chromatic index ofk-degenerate graphs
• Deterministic Graph Games and a Probabilistic Intuition
• The game chromatic number of random graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Game chromatic index of graphs with given restrictions on degrees