Example
•
Conjecture.
If there are at most two
vertices of degree 1 in a graph G, then the
graph is traceable
•
Counter-example
1
1
3
2
2
3
This graph has two
vertices of degree 1 but
it is not traceable.