Results 81 to 90 of about 676 (119)
On the optimal layout of (K<sub>p</sub> - C<sub>p</sub>)<sup>n</sup> into grid and certain structures. [PDF]
Sci RepVincy GC, Micheal DR.
europepmc +1 more source
Strongly pancyclic and dual-pancyclic graphs
Discussiones Mathematicae Graph Theory, 2009 openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Edge-pancyclicity of pancake graph
International Journal of Computer Mathematics: Computer Systems Theory, 2020Pancylicity was introduced by Bondy in 1971. A graph G with vertex set V ( G ) and edge set E ( G ) is pancyclic if it contains cycles of lengths l, for 3 ≤ l ≤ | V ( G ) | .
Chun-Nan Hung +3 more
openaire +1 more source
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
Generalizing Pancyclic and k-Ordered Graphs
Graphs and Combinatorics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faudree, Ralph J. +3 more
openaire +2 more sources