Article contents
Maximal-clique partitions of interval graphs
Published online by Cambridge University Press: 09 April 2009
Abstract
It is shown that if an interval graph possesses a maximal-clique partition then its clique covering and clique partition numbers are equal, and equal to the maximal-clique partition number. Moreover an interval graph has such a partition if and only if all its maximal cliques are edge-disjoint.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1988
References
- 3
- Cited by