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

Wai Lam FONG; Wai Hong CHAN; Ge NONG

doi:10.1007/s10878-018-0277-7

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

Wai Lam FONG
, Wai Hong CHAN
, Ge NONG

Department of Mathematics and Information Technology (MIT)

Research output: Contribution to journal › Articles › peer-review

2 Citations (Scopus)

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). Copyright © 2018 Springer Science+Business Media, LLC, part of Springer Nature.

Original language	English
Pages (from-to)	1-12
Journal	Journal of Combinatorial Optimization
Volume	36
Issue number	1
Early online date	Mar 2018
DOIs	https://doi.org/10.1007/s10878-018-0277-7
Publication status	Published - 2018

Keywords

Game chromatic index
Tree
Graph coloring game
Game chromatic number
PG student publication

Access to Document

10.1007/s10878-018-0277-7

Other files and links

@article{8b9c058a0ee4459d974a594c2271954f,

title = "The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices",

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{\textendash}6, 2014). Copyright {\textcopyright} 2018 Springer Science+Business Media, LLC, part of Springer Nature.",

author = "FONG, \{Wai Lam\} and CHAN, \{Wai Hong\} and Ge NONG",

year = "2018",

doi = "10.1007/s10878-018-0277-7",

language = "English",

volume = "36",

pages = "1--12",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer",

number = "1",

}

TY - JOUR

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

AU - FONG, Wai Lam

AU - CHAN, Wai Hong

AU - NONG, Ge

PY - 2018

Y1 - 2018

N2 - 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). Copyright © 2018 Springer Science+Business Media, LLC, part of Springer Nature.

AB - 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). Copyright © 2018 Springer Science+Business Media, LLC, part of Springer Nature.

UR - https://link-springer-com.ezproxy.eduhk.hk/article/10.1007/s10878-018-0277-7

UR - https://www.lib.eduhk.hk/pure-data/pub/201808077.pdf

U2 - 10.1007/s10878-018-0277-7

DO - 10.1007/s10878-018-0277-7

M3 - Articles

SN - 1382-6905

VL - 36

SP - 1

EP - 12

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 1

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint