Premium
Acyclic graph coloring and the complexity of the star chromatic number
Author(s) -
Guichard David R.
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170202
Subject(s) - digraph , combinatorics , chromatic scale , mathematics , generalization , star (game theory) , discrete mathematics , graph , mathematical analysis
Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, “When is χ* < χ?” We show that χ* < χ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not in NP though it is both NP‐hard and NP‐easy. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom