Hamiltonian Graphs — Study Resources & PYQs

Hamiltonian graphs and their properties.

Estimated study time: 30 minutes

Study resources

Hamiltonian and Eulerian paths/circuits, Eulerian graphs, Hamiltonian graphs - GeeksforGeeks (Article) — Classifies graphs as Hamiltonian (containing a Hamiltonian circuit) with the standard sufficient conditions (Dirac's and Ore's theorem).

Hamiltonian Graphs previous year questions

(a) Prove that if G is a simple graph with n ($n \ge 3$) vertices and if $d(v) \ge \frac{n}{2}$ for each vertex v, then G is Hamiltonian. (b) Determine the sho…

Taught in these subjects

Discrete Mathematics — BST8401 · Government College of Engineering and Technology, Jammu

Open on CachedInfo