Note on the game chromatic index of trees

P.L. Erdos; Péter L. Erdös; U. Faigle; Winfried Hochstättler; Walter Kern

doi:10.1016/j.tcs.2002.10.002

Note on the game chromatic index of trees

P.L. Erdos, Péter L. Erdös, U. Faigle, Winfried Hochstättler, Walter Kern

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

19 Citations (Scopus)

Abstract

We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.

Original language	Undefined
Pages (from-to)	371-376
Number of pages	6
Journal	Theoretical computer science
Volume	303
Issue number	3
DOIs	https://doi.org/10.1016/j.tcs.2002.10.002
Publication status	Published - 2004

Keywords

METIS-219319
Game Theory
Chromatic index
IR-76200

Access to Document

10.1016/j.tcs.2002.10.002

Cite this

@article{74474c2adb514e7c99e7643013a35971,

title = "Note on the game chromatic index of trees",

abstract = "We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.",

keywords = "METIS-219319, Game Theory, Chromatic index, IR-76200",

author = "P.L. Erdos and Erd{\"o}s, {P{\'e}ter L.} and U. Faigle and Winfried Hochst{\"a}ttler and Walter Kern",

year = "2004",

doi = "10.1016/j.tcs.2002.10.002",

language = "Undefined",

volume = "303",

pages = "371--376",

journal = "Theoretical computer science",

issn = "0304-3975",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Note on the game chromatic index of trees

AU - Erdos, P.L.

AU - Erdös, Péter L.

AU - Faigle, U.

AU - Hochstättler, Winfried

AU - Kern, Walter

PY - 2004

Y1 - 2004

N2 - We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.

AB - We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree Δ=3 is at most Δ+1. We show that the same holds true in case Δ≥6, which would leave only the cases Δ=4 and 5 open.

KW - METIS-219319

KW - Game Theory

KW - Chromatic index

KW - IR-76200

U2 - 10.1016/j.tcs.2002.10.002

DO - 10.1016/j.tcs.2002.10.002

M3 - Article

VL - 303

SP - 371

EP - 376

JO - Theoretical computer science

JF - Theoretical computer science

SN - 0304-3975

IS - 3

ER -