J Austral Math Soc Ser A 45 pp227--232, 1988.

Maximal-Clique Partitions of Interval Graphs

Ma Shaohan and W. D. Wallis

(Received 8 October 1986)

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 of its maximal cliques are edge-disjoint.

1980 AMS Subject Classification: 05C35

Browse the article

Read the article in your browser. (Scale your print to fit your paper).

Authors

Ma Shaohan: Department of Computer Science, Shandong University, Jinan, People's Republic of China.
W. D. Wallis: Department of Mathematics, Southern Illinois University, Carbondale, Illinois 62901, U.S.A.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Wed Feb 19 10:27:49 2003