Skip to main content

On graphs as unions of eulerian graphs

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics

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

Abstract

We present a criterion for a graph to be the union of a specified number of Eulerian graphs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.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. F. Harary, Graph Theory, Addison — Wesley, London, 1969.

    MATH  Google Scholar 

  2. K. R. Matthews, "On The Eulericity Of A Graph", submitted for publication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

D. A. Holton Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Little, C.H.C. (1978). On graphs as unions of eulerian graphs. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062534

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08953-7

  • Online ISBN: 978-3-540-35702-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics