Skip to main content

Clique Partitions of Chordal Graphs

  • Paul Erdős (a1), Edward T. Ordman (a2) and Yechezkel Zalcstein (a3)

To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.

Hide All
[1]Bender, E. A., Richmond, L. B. and Wormald, N. C. (1985) Almost all chordal graphs split. J. Austral. Math. Soc. (A) 38 214221.
[2]Caccetta, L., Erdős, P., Ordman, E. and Pullman, N. (1985) The difference between the clique numbers of a graph. Ars Combinatoria 19 A 97106.
[3]Chartrand, G. and Lesniak, L. (1986) Graphs and Digraphs, 2nd. Edition, Wadsworth, Belmont, CA.
[4]Chvátal, V. and Hammer, P. (1973) Set packing and threshold graphs, Univ. of Waterloo Research Report CORR 73–21.
[5]Chvátal, V. and Hammer, P. (1977) Aggregation of inequalities in integer programming. Ann. Discrete Math 1 145162.
[6]DeBruijn, N. G. and Erdős, P. (1948) On a combinatorial problem. Indag. Math. 10 421423.
[7]Erdős, P., Faudree, R. and Ordman, E. (1988) Clique coverings and clique partitions. Discrete Mathematics 72 93101.
[8]Erdős, P., Goodman, A. W. and Posa, L. (1966) The representation of a graph by set intersections. Canad. J. Math. 18 106112.
[9]Erdős, P., Gyárfás, A., Ordman, E. T. and Zalcstein, Y. (1989) The size of chordal, interval, and threshold subgraphs. Combinatorica 9 (3) 245253.
[10]Golumbic, M. (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
[11]Gregory, D. A. and Pullman, N. J. (1982) On a clique covering problem of Orlin. Discrete Math. 41 9799.
[12]Henderson, P. and Zalcstein, Y. (1977) A graph theoretic characterization of the PVchunk class of synchronizing primitives. SIAM J. Comp. 6 88108.
[13]Orlin, J. (1977) Contentment in Graph Theory: covering graphs with cliques. Indag. Math. 39 406424.
[14]Wallis, W. D. (1982) Asymptotic values of clique partition numbers. Combinatorica 2 (1) 99101.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed