Note on the game chromatic index of trees

Share/Save/Bookmark

Erdös, P.L. and Faigle, U. and Hochstättler, W. and Kern, W. (2002) Note on the game chromatic index of trees. [Report]

[img]
Preview
PDF
200Kb
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 $\Delta = 3$ is at most $\Delta + 1$. We show that the same holds true in case $\Delta \geq 6$, which would leave only the cases $\Delta = 4$ and $\Delta = 5$ open.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65838
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page