• L. Lovász
  • J. Pelikán
  • K. Vesztergombi
Part of the Undergraduate Texts in Mathematics book series (UTM)


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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2003

Authors and Affiliations

  • L. Lovász
    • 1
  • J. Pelikán
    • 2
  • K. Vesztergombi
    • 3
  1. 1.Microsoft ResearchMicrosoft CorporationRedmondUSA
  2. 2.Department of Algebra and Number TheoryEõtvõs Loránd UniversityBudapestHungary
  3. 3.Department of MathematicsUniversity of WashingtonSeattleUSA

Personalised recommendations