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
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud