AbstractThe question of the girth of cycle permutation graphs is discussed. It is demonstrated by a computer search, that there are no cycle permutation graphs with girth 9 on less than 60 vertices, and that precisely two non-isomorphic examples exist on 60 vertices
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
The problem of finding bipartite (Tanner) graphs with given degree sequences that have large girth a...
The question of the girth of cycle permutation graphs is discussed. It is demonstrated by a computer...
The question of the girth of cycle permutation graphs is discussed. It is demonstrated by a computer...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
We start with an account of the known bounds for n(3,g), the number of vertices in the smallest triv...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractThe odd girth of a graph G gives the length of a shortest odd cycle in G. It is shown that t...
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
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...
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few verti...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
The problem of finding bipartite (Tanner) graphs with given degree sequences that have large girth a...
The question of the girth of cycle permutation graphs is discussed. It is demonstrated by a computer...
The question of the girth of cycle permutation graphs is discussed. It is demonstrated by a computer...
AbstractIt is shown that a graph of large girth and minimum degree at least 3 share many properties ...
We start with an account of the known bounds for n(3,g), the number of vertices in the smallest triv...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractRecently, O'Keefe and Wong have shown that a smallest graph of girth 10 and valency 3 (a (3,...
AbstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 ha...
AbstractThe odd girth of a graph G gives the length of a shortest odd cycle in G. It is shown that t...
AbstractWe give a regular graph of girth 10 and valency 3 which has 70 vertices. We also show that n...
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...
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few verti...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
The problem of finding bipartite (Tanner) graphs with given degree sequences that have large girth a...
DOI
Add to ORKG