Search
Now showing items 1-2 of 2
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. ...
Minimum degree, leaf number and traceability
(Institute of Mathematics of the Czech Academy of Sciences, 2013-03-26)
Let G be a finite connected graph with minimum degree δ. The leaf number L (G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We prove that if δ >12(L (G) + 1), then G is 2-connected. ...