Skip to main content

Graphs

  • Chapter
  • 285k Accesses

Part of the Undergraduate Texts in Mathematics book series (UTM)

Abstract

We start with the following exercise (admittedly of no practical significance).

Keywords

  • Connected Graph
  • Hamiltonian Cycle
  • Parallel Edge
  • Petersen Graph
  • Consecutive Node

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/0-387-21777-0_7
  • Chapter length: 16 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   44.99
Price excludes VAT (USA)
  • ISBN: 978-0-387-21777-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   59.99
Price excludes VAT (USA)
Hardcover Book
USD   84.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 2003 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Lovász, L., Pelikán, J., Vesztergombi, K. (2003). Graphs. In: Discrete Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-21777-0_7

Download citation

  • DOI: https://doi.org/10.1007/0-387-21777-0_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-95585-8

  • Online ISBN: 978-0-387-21777-2

  • eBook Packages: Springer Book Archive