Let $G$ be an undirected graph on at least five vertices let and $\overline{G}$ its complement. Let $h(G)$ be the number of Hamiltonian paths of $G$.
Posted: Aug 01 '12
Seen: 70 times
Last updated: Aug 01 '12
Basics of Pigeonhole Principle
Degree sequence is reconstructible
Diameter and low-degree vertex