Another Form of Conjectures

•Graffiti.pc was also asked to make necessary
conditions for traceable graphs.
**Conjecture.**
If the graph *G* is traceable, then the minimum degree of *G*
is at least half of *k*, where *k* is the number of
vertices of minimum degree.

Counter-example

2

2

2

2

2

2

Graph
is traceable

Minimum
degree = 2

K
= 6

But
2 ≥ (1/2) *
6

2 ≥ 3