On cocolourings and cochromatic numbers of graphs (Q1315460)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 513342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cocolourings and cochromatic numbers of graphs |
scientific article; zbMATH DE number 513342 |
Statements
On cocolourings and cochromatic numbers of graphs (English)
0 references
29 August 1994
0 references
A cocolouring of a graph \(G\) is a partition of the vertices such that each set of the partition induces either a clique or an independent set in \(G\). The cochromatic number \(z(G)\) is the smallest cardinality of a cocolouring of \(G\). Given a graph \(G\) and an integer \(k\), the cochromatic number problem, i.e., determine if \(z(G) \leq k\), is known to be NP- complete. Here the authors show that it remains NP-complete for line graphs of comparability graphs and present polynomial time algorithms for computing the cochromatic number of chordal graphs and graphs containing no induced \(P_ 4\).
0 references
cocolouring
0 references
cochromatic number
0 references
cochromatic number problem
0 references
NP-complete
0 references
line graphs
0 references
comparability graphs
0 references
polynomial time algorithms
0 references
chordal graphs
0 references
0 references
0 references
0 references
0 references
