@book{e59733ab2fd64535aeef92edafe5b2d2,

title = "Backbone colorings for networks: tree and path backbones",

abstract = "We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph $G=(V,E)$ and a spanning subgraph $H$ of $G$ (the backbone of $G$), a backbone coloring for $G$ and $H$ is a proper vertex coloring $V\rightarrow \{1,2,\ldots\}$ of $G$ in which the colors assigned to adjacent vertices in $H$ differ by at least two. We study the cases where the backbone is either a spanning tree or a spanning path.",

keywords = "MSC-05C85, MSC-05C15, IR-65890, EWI-3525, MSC-05C17",

author = "Broersma, {Haitze J.} and F.V. Fomin and P.A. Golovach and Gerhard Woeginger",

note = "Imported from MEMORANDA",

year = "2003",

language = "Undefined",

series = "Memorandum",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1705",

}