chapter  6
36 Pages

Hamiltonian Graphs

In the previous chapter, we were introduced to Eulerian graphs, which are those graphs G possessing a circuit containing every edge of G. In this chapter, we turn our attention to those graphs G possessing a cycle containing every vertex of G.