The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices

Wai Lam Fong, Wai Hong Chan () and Ge Nong
Additional contact information
Wai Lam Fong: The Education University of Hong Kong
Wai Hong Chan: The Education University of Hong Kong
Ge Nong: Sun Yat-sen University

Journal of Combinatorial Optimization, 2018, vol. 36, issue 1, No 1, 12 pages

Abstract: Abstract 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).

Keywords: Game chromatic index; Tree; Graph coloring game; Game chromatic number (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0277-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:36:y:2018:i:1:d:10.1007_s10878-018-0277-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0277-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().