Skip to main content
SpringerLink
Log in

Clique coverings of graphs — A survey

  • Invited Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics X

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1036))

Abstract

The problem of covering and partitioning the edge set of a simple graph with a minimum number of complete subgraphs has been studied by several writers over the years. This paper surveys some of the progress made so far and presents a number of open problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cacetta, L. and Pullman, N.J. Clique Covering Numbers of Cubic Graphs. Proceedings Combinatorial Mathematics X, (1982).

    Google Scholar 

  2. Cacetta, L. and Pullman, N.J. Clique Covering Numbers of Regular Graphs. (To appear.)

    Google Scholar 

  3. de Bruijn, N.G. and Erdös, P. On a combinatorial problem. Indag. Math., 10 (1948), 421–423.

    MATH  Google Scholar 

  4. Eades, P., Pullman, N.J. and Robinson, P.J. On Clique Partition Numbers of Regular Graphs. Proceedings of the Waterloo Conference on Combinatorial Mathematics, University of Waterloo, (1982).

    Google Scholar 

  5. Erdös, P., Goodman, A.W. and Pósa, L. The representation of a graph by set intersections. Can. J. Math., 18 (1966), 106–112.

    Article  MathSciNet  MATH  Google Scholar 

  6. Erdös, P., Mullin, R.C., Sós, V.T. and Stinson, D.R. Finite linear spaces and projective planes. Discrete Mathematics. (To appear.)

    Google Scholar 

  7. Erdös, P., Sós, V.T. and Wilson, R. On t-designs. (To appear.)

    Google Scholar 

  8. Gregory, D.A. and Pullman, N.J. On a clique covering problem of Orlin. Discrete Mathematics. (To appear.)

    Google Scholar 

  9. Hall, M. Jr. A problem in partitions. Bull. Amer. Math. Soc., 47 (1941), 804–807.

    Article  MathSciNet  MATH  Google Scholar 

  10. Lovász, L. On covering of graphs. Theory of Graphs, 231–236. (Proc. Colloq. Tihany (1966). Academic Press, New York and London (1968).)

    Google Scholar 

  11. Orlin, J. Contentment in graph theory. Indag. Math., 39 (1977), 406–424.

    Article  MathSciNet  MATH  Google Scholar 

  12. Pullman, N.J. Clique coverings of graphs IV: algorithms. (To appear.)

    Google Scholar 

  13. Pullman, N.J. and de Caen, D. Clique coverings of graphs III: clique coverings of regular graphs. Cong. Numer., 29 (1980), 795–808.

    MathSciNet  MATH  Google Scholar 

  14. Pullman, N.J. and de Caen, D. Clique coverings of graphs I: clique partitions of regular graphs. Utilitas Math., 19 (1981), 177–205.

    MathSciNet  MATH  Google Scholar 

  15. Pullman, N.J. and Donald, A. Clique coverings of graphs II: complements of cliques. Utilitas Math., 19 (1981), 207–213.

    MathSciNet  MATH  Google Scholar 

  16. Roberts, F.S. Applications of edge coverings by cliques. (To appear.)

    Google Scholar 

  17. Ryser, H.J. Intersection properties of finite sets. J. Comb. Th. (A), 14 (1973), 79–92.

    Article  MathSciNet  MATH  Google Scholar 

  18. Spilrajn-Marczewski, E. Sur deux proprietes des classes d'ensembles. Fund. Math., 33 (1945), 303–307.

    MathSciNet  MATH  Google Scholar 

  19. Wallis, W.D. Asymptotic values of clique partition numbers. Combinatorica. (To appear.)

    Google Scholar 

Download references

Authors
  1. Norman J. Pullman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Louis Reynolds Antoine Casse

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Pullman, N.J. (1983). Clique coverings of graphs — A survey. In: Casse, L.R.A. (eds) Combinatorial Mathematics X. Lecture Notes in Mathematics, vol 1036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071509

Download citation

  • DOI: https://doi.org/10.1007/BFb0071509

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12708-6

  • Online ISBN: 978-3-540-38694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation