Note on the game chromatic index of trees

Share/Save/Bookmark

Erdös, Péter L. and Faigle, Ulrich and Hochstättler, Winfried and Kern, Walter (2004) Note on the game chromatic index of trees. Theoretical Computer Science, 313 (3). pp. 371-376. ISSN 0304-3975

[img] PDF
Restricted to UT campus only
: Request a copy
178kB
Abstract:We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.
Item Type:Article
Copyright:© 2004 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/76200
Official URL:http://dx.doi.org/10.1016/j.tcs.2002.10.002
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 219319