G. A. Dirac’s Theorem
Theorem (Dirac 1952).
number of vertices of the graph. If the
minimum degree of a graph is greater than
or equal to
, then the graph is
This type of statement is called a sufficient condition
for the traceability of a graph. Graffiti.pc was asked
to make conjectures that also give sufficient
conditions for the traceability of a graph.