Posted by S. Lakshminarayana on August 14, 19100 at 06:50:09:
Can some one help me in the following.
If a graph has n vetexs, n-1 edges atmost one vertex having degree
two and one vertex is of degree 3.
Can we say it can be a hamiltonian
or can we say there are chances for non-hamiltonian
regards