Note on the game chromatic index of trees

P.L. Erdös; U. Faigle; W. Hochstättler; Walter Kern

Note on the game chromatic index of trees

P.L. Erdös
, U. Faigle
, W. Hochstättler
, Walter Kern

Discrete Mathematics and Mathematical Programming

Research output: Book/Report › Report › Other research output

312 Downloads (Pure)

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 $\Delta = 3$ is at most $\Delta + 1$. We show that the same holds true in case $\Delta \geq 6$, which would leave only the cases $\Delta = 4$ and $\Delta = 5$ open.

Original language	Undefined
Place of Publication	Enschede
Publisher	University of Twente
Publication status	Published - 2002

Publication series

Name	Memorandum / Faculty of Mathematical Sciences
Publisher	Department of Applied Mathematics, University of Twente
No.	1652
ISSN (Print)	0169-2690

Keywords

MSC-90D46
IR-65838
EWI-3472

Access to Document

1652Final published version, 200 KB

Cite this

@book{8dafd80805bc49f49bce697ed8905fdc,

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 \$\textbackslash{}Delta = 3\$ is at most \$\textbackslash{}Delta + 1\$. We show that the same holds true in case \$\textbackslash{}Delta \textbackslash{}geq 6\$, which would leave only the cases \$\textbackslash{}Delta = 4\$ and \$\textbackslash{}Delta = 5\$ open.",

keywords = "MSC-90D46, IR-65838, EWI-3472",

author = "P.L. Erd{\"o}s and U. Faigle and W. Hochst{\"a}ttler and Walter Kern",

year = "2002",

language = "Undefined",

series = "Memorandum / Faculty of Mathematical Sciences",

publisher = "University of Twente",

number = "1652",

address = "Netherlands",

}

TY - BOOK

T1 - Note on the game chromatic index of trees

AU - Erdös, P.L.

AU - Faigle, U.

AU - Hochstättler, W.

AU - Kern, Walter

PY - 2002

Y1 - 2002

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 $\Delta = 3$ is at most $\Delta + 1$. We show that the same holds true in case $\Delta \geq 6$, which would leave only the cases $\Delta = 4$ and $\Delta = 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 $\Delta = 3$ is at most $\Delta + 1$. We show that the same holds true in case $\Delta \geq 6$, which would leave only the cases $\Delta = 4$ and $\Delta = 5$ open.

KW - MSC-90D46

KW - IR-65838

KW - EWI-3472

M3 - Report

T3 - Memorandum / Faculty of Mathematical Sciences

BT - Note on the game chromatic index of trees

PB - University of Twente

CY - Enschede

ER -