Note on the game chromatic index of trees

DOI10.1016/j.tcs.2002.10.002zbMath1066.91015OpenAlexW1977156965MaRDI QIDQ1884997

Ulrich Faigle, Winfried Hochstättler, Walter Kern, Péter L. Erdős

Publication date: 27 October 2004

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

Full work available at URL: https://research.utwente.nl/en/publications/note-on-the-game-chromatic-index-of-trees(8dafd808-05bc-49f4-9bce-697ed8905fdc).html

zbMATH Keywords

Game theoryChromatic index

Mathematics Subject Classification ID

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

Related Items (14)

The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Game-perfect digraphs ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ The edge coloring game on trees with the number of colors greater than the game chromatic index ⋮ The game chromatic index of wheels ⋮ The game chromatic index of some trees of maximum degree 4 ⋮ A note on the game chromatic index of graphs ⋮ Game chromatic index of graphs with given restrictions on degrees ⋮ A new upper bound on the game chromatic index of graphs ⋮ The incidence game chromatic number ⋮ The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\) ⋮ The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices ⋮ On the relaxed colouring game and the unilateral colouring game ⋮ Unnamed Item

Cites Work

• Game chromatic index ofk-degenerate graphs
• Radius two trees specify χ‐bounded classes
• A new game chromatic number
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on the game chromatic index of trees