Fixed-parameter algorithms for the cocoloring problem

A (k,ℓ)-cocoloring of a graph G is a partition of the vertex set of G into at most k independent sets and at most ℓ cliques. It is known that determining the cochromatic number and the split chromatic number, which are respectively the minimum k+ℓ and the minimum max{k,ℓ} such that G is (k,ℓ)-cocolo...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 167; pp. 52 - 60
Main Authors:	Campos, Victor, Klein, Sulamita, Sampaio, Rudini, Silva, Ana
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.04.2014
Subjects:	[formula omitted]-graphs Algorithms Bounded treewidth Cochromatic number Cocoloring Fixed-parameter tractability Graphs Mathematical analysis Partitions Polynomials Cochromatic number Bounded treewidth Cocoloring Fixed-parameter tractability (q,q−4)-graphs
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!