A Note on the Game Chromatic Index of Graphs期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

A Note on the Game Chromatic Index of Graphs

Authors:	Tomasz?Bartnicki author-information" > author-information__contact u-icon-before" > mailto:t.bartnicki@wmie.uz.zgora.pl" title=" t.bartnicki@wmie.uz.zgora.pl" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,Jaros?aw?Grytczuk

Affiliation:	(1) Faculty of Mathematics, Computer Science, and Econometricsm, University of Zielona Góra, ul. Szafrana 4a, 65-516 Zielona Góra, Poland;(2) Theoretical Computer Science Department, Jagiellonian University, ul. Gronostajowa 3, 30-387 Kraków, Poland

Abstract:	In this note we prove that the game chromatic index χ_g^′(G) of a graph G of arboricity k is at most Δ + 3k − 1. This improves a bound obtained by Cai and Zhu [J. Graph Theory 36 (2001), 144–155] for k-degenerate graphs. Tomasz Bartnicki: Research of the first author is supported by a PhD grant from Polish Ministry of Science and Higher Education N201 2128 33. Received: November 1, 2006. Final version received: December 22, 2007.

Keywords:	Chromatic index game chromatic index arboricity
本文献已被 SpringerLink 等数据库收录！