The game chromatic index of forests of maximum degree Deltage5

Andres, Dominique (2006) The game chromatic index of forests of maximum degree Deltage5.
Published in: Discrete Applied Mathematics Vol. 154 (9). pp. 1317-1323.

Abstract

We prove that the game chromatic index of a forest of maximum degree d (of at least 5) is at most d+1. This bound is tight.


Actions:
Download: [img] Postscript - Preprinted Version
Download (288kB) | Preview
Download: [img] PDF - Preprinted Version
Download (120kB) | Preview
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: No citation data.
Uncontrolled Keywords: game chromatic index forest graph colouring games game chromatic number strongly unmatched edge
Subjects:
  • 91-XX Game theory, economic, social and behavioral sciences > 91Axx Game theory > 91A43 Games involving graphs

  • 05-XX Combinatorics > 05Cxx Graph theory > 05C15 Coloring of graphs and hypergraphs

    		•
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Schrader
    Mathematical Institute > Prof. Dr. Faigle
    Related URLs:
    Deposit Information:
    ZAIK Number: zaik2005-505
    Depositing User: Dominique Andres
    Date Deposited: 07 Aug 2006 00:00
    Last Modified: 19 Dec 2011 09:44
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/505