AbstractThe girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph. D. dissertation, Louisiana State University, Baton Rouge, LA) conjectured that every graph G with girth at least 2t+1 and minimum degree at least k/t contains every treeT with k edges whose maximum degree does not exceed the minimum degree of G. The conjecture has been proved for t⩽3. In this paper, we prove Dobson's conjecture
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractDobson conjectured that for every t and k a tree with k vertices can always be embedded into...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
Abstract. We study minimum degree conditions for which a graph with given odd girth has a simple str...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractDobson conjectured that for every t and k a tree with k vertices can always be embedded into...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
Abstract. We study minimum degree conditions for which a graph with given odd girth has a simple str...
A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circum...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
DOI
Add to ORKG