Search
Now showing items 1-1 of 1
Spanning paths in graphs
(Elsevier, 2018-08-29)
The Conjecture, Graffiti.pc 190, of the computer program Graffiti.pc, instructed by DeLavi˜na,
state that every simple connected graph G with minimum degree δ and leaf number L(G)
such that δ ≥ 1 2 (L(G) + 1), is traceable. ...