Backbone colorings for networks: tree and path backbones

Haitze J. Broersma, F.V. Fomin, P.A. Golovach, Gerhard Woeginger

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

6 Downloads (Pure)

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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2003

Publication series

NameMemorandum
PublisherDepartment of Applied Mathematics, University of Twente
No.1705
ISSN (Print)0169-2690

Keywords

  • MSC-05C85
  • MSC-05C15
  • IR-65890
  • EWI-3525
  • MSC-05C17

Cite this

Broersma, H. J., Fomin, F. V., Golovach, P. A., & Woeginger, G. (2003). Backbone colorings for networks: tree and path backbones. (Memorandum; No. 1705). Enschede: University of Twente, Department of Applied Mathematics.
Broersma, Haitze J. ; Fomin, F.V. ; Golovach, P.A. ; Woeginger, Gerhard. / Backbone colorings for networks: tree and path backbones. Enschede : University of Twente, Department of Applied Mathematics, 2003. (Memorandum; 1705).
@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",

}

Broersma, HJ, Fomin, FV, Golovach, PA & Woeginger, G 2003, Backbone colorings for networks: tree and path backbones. Memorandum, no. 1705, University of Twente, Department of Applied Mathematics, Enschede.

Backbone colorings for networks: tree and path backbones. / Broersma, Haitze J.; Fomin, F.V.; Golovach, P.A.; Woeginger, Gerhard.

Enschede : University of Twente, Department of Applied Mathematics, 2003. (Memorandum; No. 1705).

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

TY - BOOK

T1 - Backbone colorings for networks: tree and path backbones

AU - Broersma, Haitze J.

AU - Fomin, F.V.

AU - Golovach, P.A.

AU - Woeginger, Gerhard

N1 - Imported from MEMORANDA

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - MSC-05C85

KW - MSC-05C15

KW - IR-65890

KW - EWI-3525

KW - MSC-05C17

M3 - Report

T3 - Memorandum

BT - Backbone colorings for networks: tree and path backbones

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Broersma HJ, Fomin FV, Golovach PA, Woeginger G. Backbone colorings for networks: tree and path backbones. Enschede: University of Twente, Department of Applied Mathematics, 2003. (Memorandum; 1705).

Access to Document

  • 1705

    open

    Final published version, 245 KB