More about subcolorings

Haitze J. Broersma, F.V. Fomin, J. Nešetřil, Gerhard Woeginger

Research output: Book/ReportReportOther research output

42 Downloads (Pure)

Abstract

A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2002

Publication series

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

Fingerprint

Vertex Coloring
Clique
Combinatorics
Disjoint
Union
Graph in graph theory
Class
Color

Keywords

  • MSC-94C15
  • MSC-05C78
  • MSC-05C15
  • IR-65822
  • MSC-68W25
  • EWI-3455
  • MSC-68R10

Cite this

Broersma, H. J., Fomin, F. V., Nešetřil, J., & Woeginger, G. (2002). More about subcolorings. (Memorandum; No. 1635). Enschede: University of Twente, Department of Applied Mathematics.
Broersma, Haitze J. ; Fomin, F.V. ; Nešetřil, J. ; Woeginger, Gerhard. / More about subcolorings. Enschede : University of Twente, Department of Applied Mathematics, 2002. (Memorandum; 1635).
@book{1f6e3d73305b4237847084d507f7c968,
title = "More about subcolorings",
abstract = "A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings.",
keywords = "MSC-94C15, MSC-05C78, MSC-05C15, IR-65822, MSC-68W25, EWI-3455, MSC-68R10",
author = "Broersma, {Haitze J.} and F.V. Fomin and J. Nešetřil and Gerhard Woeginger",
year = "2002",
language = "English",
series = "Memorandum",
publisher = "University of Twente, Department of Applied Mathematics",
number = "1635",

}

Broersma, HJ, Fomin, FV, Nešetřil, J & Woeginger, G 2002, More about subcolorings. Memorandum, no. 1635, University of Twente, Department of Applied Mathematics, Enschede.

More about subcolorings. / Broersma, Haitze J.; Fomin, F.V.; Nešetřil, J.; Woeginger, Gerhard.

Enschede : University of Twente, Department of Applied Mathematics, 2002. (Memorandum; No. 1635).

Research output: Book/ReportReportOther research output

TY - BOOK

T1 - More about subcolorings

AU - Broersma, Haitze J.

AU - Fomin, F.V.

AU - Nešetřil, J.

AU - Woeginger, Gerhard

PY - 2002

Y1 - 2002

N2 - A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings.

AB - A subcoloring is a vertex coloring of a graph in which every color class induces a disjoint union of cliques. We derive a number of results on the combinatorics, the algorithmics, and the complexity of subcolorings.

KW - MSC-94C15

KW - MSC-05C78

KW - MSC-05C15

KW - IR-65822

KW - MSC-68W25

KW - EWI-3455

KW - MSC-68R10

M3 - Report

T3 - Memorandum

BT - More about subcolorings

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Broersma HJ, Fomin FV, Nešetřil J, Woeginger G. More about subcolorings. Enschede: University of Twente, Department of Applied Mathematics, 2002. (Memorandum; 1635).