Top

Journal of Combinatorial Optimization

Published in:

22-03-2018

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

Authors: Wai Lam Fong, Wai Hong Chan, Ge Nong

Published in: Journal of Combinatorial Optimization | Issue 1/2018

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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

next article Minimum choosability of planar graphs

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Andres SD (2003) Spieltheoretische Kantenfärbungsprobleme auf Wäldern und verwandte Strukturen (German), Diplomarbeit, Universität zu Köln (2003), 49–50; 55–56; 58; 61; 83–95; 97–123

Andres SD (2006) The game chromatic index of forests of maximum degree \(\Delta \ge 5\). Discrete Appl Math 154(9):1317–1323MathSciNetCrossRefMATH

Bodlaender HL (1991) On the complexity of some colouring games. Graph-theoretic concepts in computer science (Berlin, 1990), 30–40, Lecture Notes in Comput. Sci., 484, Springer, Berlin, 1991

Cai L, Zhu X (2001) Game chromatic index of k-degenerate graphs. J. Graph Theory 36:144–155MathSciNetCrossRefMATH

Chan WH, Nong G (2014) The game chromatic index of some trees of maximum degree 4. Discrete Appl Math 170:1–6MathSciNetCrossRefMATH

Erdös P, Faigle U, Hochstättler W, Kern W (2004) Note on the game chromatic index of trees. Theor Comput Sci 313:371–376MathSciNetCrossRefMATH

Title: The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices
Authors: Wai Lam Fong
Wai Hong Chan
Ge Nong
Publication date: 22-03-2018
Publisher: Springer US
Published in: Journal of Combinatorial Optimization / Issue 1/2018
Print ISSN: 1382-6905
Electronic ISSN: 1573-2886
DOI: https://doi.org/10.1007/s10878-018-0277-7

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Other articles of this Issue 1/2018

Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks

Minimum 2-distance coloring of planar graphs and channel assignment

Approximation algorithms for the bus evacuation problem

An improved online evacuation strategy from a convex region on grid networks

Neighbor sum distinguishing total coloring of graphs with bounded treewidth

Algorithms for connected p-centdian problem on block graphs

Premium Partner