This textbook is available atAmazon.com Logo
Discrete Mathematics With Applications 5th Edition

Discrete Mathematics With Applications (5th Edition)

Book Edition5th Edition
Author(s)Epp
ISBN9781337694193
PublisherCengage
SubjectMath
Section 10.6: Spanning Trees and a Shortest Path Algorithm
Chapter 10, Section 10.1, EXERCISE SET , Exercise 38
Page 696

Give two examples of graphs that have Euler circuits but not Hamiltonian circuits.

Page 696