Location of Repository

Acyclic and Star Colorings of Cographs

By Andrew Lyons

Abstract

An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. We prove that every acyclic coloring of a cograph is also a star coloring and give a linear-time algorithm for finding an optimal acyclic and star coloring of a cograph. We also show that the acyclic chromatic number, the star chromatic number, the treewidth plus one, and the pathwidth plus one are all equal for cographs

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.161.7400
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mcs.anl.gov/~lyonsa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.