Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2003)
Spieltheoretische Kantenfärbungsprobleme aufWäldern und verwandte Strukturen (Ger
S. Andres (2003)
The Game Chromatic Index of Forests of Maximum Degree 5Electron. Notes Discret. Math., 13
L. Cai, Xuding Zhu (2001)
Game chromatic index of k-degenerate graphsJ. Graph Theory, 36
W. Chan, Ge Nong (2014)
The game chromatic index of some trees of maximum degree 4Discret. Appl. Math., 170
P. Erdös, U. Faigle, W. Hochstättler, W. Kern (2004)
Note on the game chromatic index of treesTheor. Comput. Sci., 313
P. Heggernes (2016)
Graph-Theoretic Concepts in Computer Science, 9941
SD Andres (2006)
The game chromatic index of forests of maximum degree $$\Delta \ge 5$$ Δ ≥ 5Discrete Appl Math, 154
We prove that the game chromatic index of trees of maximum degree 4 with every 4-vertex (degree-four vertex) being adjacent to at most one 4-vertex does not exceed 5. This relaxes the assumption that the trees do not contain adjacent 4-vertices in the result of Chan and Nong (Discrete Appl Math 170:1–6, 2014).
Journal of Combinatorial Optimization – Springer Journals
Published: Mar 22, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.