Skip to main content

On clique covering numbers of cubic graphs

Contributed Papers

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

Abstract

The clique covering number of a graph is the smallest number of complete subgraphs needed to cover its edge-set. For each n, we determine the set of those integers which are clique covering numbers of connected, cubic graphs on n vertices. The analogous result for 4-regular graphs is stated.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bondy, J.A. and Murty, U.S.R., Graph Theory with Applications, The MacMillan Press, London (1977).

    MATH  Google Scholar 

  2. Caccetta, L. and Pullman, N.J., "Clique Covering Numbers of Regular Graphs."

    Google Scholar 

  3. 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 

  4. Erdős, P., Goodman, A.W., and Pósa, L., "The Representation of a Graph by Set Intersections", Can. J. Math. v.18 (1966), pp.106–112.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Gregory, D.A. and Pullman, N.J., "On a Clique Covering Problem of Orlin", Discrete Mathematics (to appear).

    Google Scholar 

  6. Lovász, L., "On covering of graphs", Theory of Graphs, (Proceedings of the Colloquium held at Tihany, Hungary, September 1966), (P. Erdős and G. Katona eds.) Academic Press, N.Y. (1968)-pp.231–236.

    Google Scholar 

  7. Orlin, J., "Contentment in Graph Theory: Covering Graphs with Cliques", K. Nederlandse Ak. van Wetenschappen Proc. Ser. A,V. 80 (1977), pp.406–424.

    MathSciNet  MATH  Google Scholar 

  8. Pullman, N.J. and de Caen, D., "Clique Coverings of Graphs I: cliquepartitions of regular graphs", Utilitas Math. v.19 (1981) pp.177–206.

    MathSciNet  MATH  Google Scholar 

  9. Pullman, N.J. and Donald, A.W., "Clique Coverings of Graphs II: complements of complete graphs", Utilitas Math. V.19 (1981) pp.207–214.

    MathSciNet  MATH  Google Scholar 

  10. Pullman, N.J. and de Caen, D., "Clique Coverings of Graphs III: cliquecoverings of regular graphs", Congressus Numerantium, V.29 (1980), pp.795–808.

    MathSciNet  MATH  Google Scholar 

  11. Pullman, N.J., "Clique Coverlings of Graphs IV–Algorithms", (to appear).

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Caccetta, L., Pullman, N.J. (1983). On clique covering numbers of cubic graphs. In: Casse, L.R.A. (eds) Combinatorial Mathematics X. Lecture Notes in Mathematics, vol 1036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071513

Download citation

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

  • 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