More about subcolorings

Authors:
Hajo Broersma;Fedor V. Fomin;Jaroslav Nešetřil;Gerhard J. Woeginger
Affiliations:
Faculty of Mathematical Sciences, University of Twente, 7500 AE Enschede, The Netherlands;Heinz Nixdorf Institut, University of Paderborn, D-33102 Paderborn, Germany;Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI), Faculty of Mathematics and Physics, Charles University, 118 00 Prague, Czech Republic;Faculty of Mathematical Sciences, University of Twente, 7500 AE Enschede, The Netherlands
Venue:
Computing
Year:
2002

Citing 9
Cited 4

Generalized colorings of outerplanar and planar graphs

Graph theory with applications to algorithms and computer science
Generalized colorings of graphs

Graph theory with applications to algorithms and computer science
The subchromatic number of a graph

Discrete Mathematics - Graph colouring and variations
On cocolourings and cochromatic numbers of graphs

Discrete Applied Mathematics
On the NP-completeness of the k-colorability problem for triangle-free graphs

Discrete Mathematics
The complexity of G-free colourability

Proceedings of an international symposium on Graphs and combinatorics
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Graph classes: a survey

Graph classes: a survey
Graph Subcolorings: Complexity and Algorithms

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

A hypocoloring model for batch scheduling

Discrete Applied Mathematics
Path-Bicolorable Graphs

Graph Theory, Computational Intelligence and Thought
A hypocoloring model for batch scheduling

Discrete Applied Mathematics
On 2-subcolourings of chordal graphs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

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.On the negative side, we prove that 2-subcoloring is NP-hard for comparability graphs, and that 3-subcoloring is NP-hard for AT-free graphs and for complements of planar graphs. On the positive side, we derive polynomial time algorithms for 2-subcoloring of complements of planar graphs, and for r-subcoloring of interval and of permutation graphs. Moreover, we prove asymptotically best possible upper bounds on the subchromatic number of interval graphs, chordal graphs, and permutation graphs in terms of the number of vertices.