Results 81 to 90 of about 105 (94)
Some of the next articles are maybe not open access.
Cycle-pancyclism in tournaments I
Graphs and Combinatorics, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galeana-Sánchez, Hortensia +1 more
openaire +1 more source
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Jianxi, Lin, Xiaola, Jia, Xiaohua
openaire +2 more sources
Pancyclicity in switching classes
Information Processing Letters, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehrenfeucht, A. +3 more
openaire +2 more sources
Vertex‐pancyclicity of hypertournaments
Journal of Graph Theory, 2009AbstractA hypertournament or a k‐tournament, on n vertices, 2≤k≤n, is a pair T=(V, E), where the vertex set V is a set of size n and the edge set E is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations.
openaire +3 more sources
Journal of Graph Theory, 1998
Summary: In generalizing the concept of a pancyclic graph, we say that a graph is ``weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required ...
Brandt, Stephan +2 more
openaire +2 more sources
Summary: In generalizing the concept of a pancyclic graph, we say that a graph is ``weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic are considerably weaker than those required ...
Brandt, Stephan +2 more
openaire +2 more sources
Extending Vertex and Edge Pancyclic Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Megan Cream +2 more
openaire +1 more source
Journal of Graph Theory, 1994
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +2 more sources
AbstractLet D be an oriented graph of order n ≧ 9 and minimum degree n − 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ≅ A(D), or dD+(u) + dD−(v) ≧ n − 3.
openaire +2 more sources
2016
Recall that a pancyclic graph is called uniquely pancyclic, or UPC, if it contains exactly one cycle of every possible length. In 1973, Roger Entringer asked (see Bondy (J. Combinatorial Theory (B) 11:80–84, 1971), p. 247), for what orders do UPC graphs exist?
John C. George +2 more
openaire +1 more source
Recall that a pancyclic graph is called uniquely pancyclic, or UPC, if it contains exactly one cycle of every possible length. In 1973, Roger Entringer asked (see Bondy (J. Combinatorial Theory (B) 11:80–84, 1971), p. 247), for what orders do UPC graphs exist?
John C. George +2 more
openaire +1 more source
Regular Hypertournaments and Arc‐Pancyclicity
Journal of Graph Theory, 2016AbstractAk‐hypertournamentHonnvertices () is a pair, whereVis the vertex set ofHandAis a set ofk‐tuples of vertices, called arcs, such that for all subsetswith,Acontains exactly one permutation ofSas an arc. Recently, Li et al. showed that any strongk‐hypertournamentHonnvertices, where, is vertex‐pancyclic, an extension of Moon's theorem for ...
openaire +2 more sources