Results 111 to 120 of about 878 (132)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite [PDF]

Xinyao Liu, Caili Jia, Yong Lu, Jianxin Zhong   +3 more
openalex   +1 more source

Pancyclicity of claw-free hamiltonian graphs

, 1999
H. Trommel, H.J. Veldman, A. Verschut
openalex   +2 more sources

Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments [PDF]

, 2008
Jinfeng Feng, Yubao Guo
openalex  

A problem concerning $j$-pancyclic graphs

, 1974
Vasil Jacoš, Stanislav Jendrol′
openalex   +1 more source

Doubly Chorded Vertex Pancyclicity on K1,3-Free Graphs

Zengxian TIAN, Jing Yang, G. He
openalex   +1 more source

Results on edge-colored graphs and pancyclicity

, 2014
James M. Carraher
openalex   +1 more source

New sufficient conditions for Hamiltonian, pancyclic and edge-Hamilton graphs

Fayun Cao, Han Ren
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Extending Vertex and Edge Pancyclic Graphs

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Megan Cream, Ronald J. Gould, Kazuhide Hirohata   +2 more
openaire   +1 more source

Pancyclic oriented graphs

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