caa a22 4500 386307245 CHVBK 20180307111533.0 cr unu---uuuuu 161130e198810 xx s 000 0 eng 10.1017/S1446788700030147 doi S1446788700030147 pii (NATIONALLICENCE)cambridge-10.1017/S1446788700030147 Maximal-clique partitions of interval graphs [Elektronische Daten] 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. Copyright © Australian Mathematical Society 1988 05 C 35 nationallicence Shaohan Ma Department of Computer Science, Shandong University Jinan People's Republic of China Wallis W. D. Department of Mathematics Southern Illinois University Carbondale, Illinois 62901, U.S.A. Journal of the Australian Mathematical Society Cambridge University Press 45/2(1988-10), 227-232 1446-7887 45:2<227 1988 45 JAZ https://doi.org/10.1017/S1446788700030147 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1017/S1446788700030147 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Shaohan Ma Department of Computer Science, Shandong University Jinan People's Republic of China NATIONALLICENCE 700 1- Wallis W. D. Department of Mathematics Southern Illinois University Carbondale, Illinois 62901, U.S.A NATIONALLICENCE 773 0- Journal of the Australian Mathematical Society Cambridge University Press 45/2(1988-10), 227-232 1446-7887 45:2<227 1988 45 JAZ CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-cambridge