Approximating Minimum Cocolourings

Authors:
Fedor V. Fomin;Dieter Kratsch;Jean-Christophe Novelli
Affiliations:
-;-;-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 7
Cited 0

Chromatic number versus cochromatic number in graphs with bounded clique number

European Journal of Combinatorics
On cocolourings and cochromatic numbers of graphs

Discrete Applied Mathematics
Subgraphs with a large cochromatic number

Journal of Graph Theory
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
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cocolouring of a graph G is a partition of the vertex set of G such that each set of the partition is either a clique or an independent set in G. Some special cases of the minimum cocolouring problem are of particular interest. We provide polynomial-time algorithms to approximate a mimimum cocolouring on graphs, partially ordered sets and sequences. In particular, we obtain an efficient algorithm to approximate within a factor of 1.71 a minimum partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence into increasing and decreasing subsequences.