Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Combinatorial Optimization Springer Journals

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

Loading next page...
1
 
/lp/springer_journal/the-game-chromatic-index-of-some-trees-with-maximum-degree-four-and-UQ2b22whGz

References (7)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Mathematics; Combinatorics; Convex and Discrete Geometry; Mathematical Modeling and Industrial Mathematics; Theory of Computation; Optimization; Operations Research/Decision Theory
ISSN
1382-6905
eISSN
1573-2886
DOI
10.1007/s10878-018-0277-7
Publisher site
See Article on Publisher Site

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

Journal

Journal of Combinatorial OptimizationSpringer Journals

Published: Mar 22, 2018

There are no references for this article.