Results 121 to 124 of about 1,031 (124)
Some of the next articles are maybe not open access.

Notes on vertex pancyclicity of graphs

Information Processing Letters, 2013
In (2012) [7], Kewen Zhao and Yue Lin introduced a new sufficient condition for pancyclic graphs and proved that if G is a 2-connected graph of order n>=6 with |N(x)@?N(y)|+d(w)>=n for any three vertices x,y,w of d(x,y)=2 and wx or [email protected]?E(G), then G is 4-vertex pancyclic or G belongs to two classes of well-structured exceptional graphs ...
Shengjia Li   +3 more
openaire   +2 more sources

Uniquely Pancyclic Graphs

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   +2 more sources

Pancyclicity of recursive circulant graphs

Information Processing Letters, 2002
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.
Yukio Shibata, Toru Araki
openaire   +2 more sources

Pancyclicity of connected circulant graphs

Journal of Graph Theory, 1996
openaire   +2 more sources

Home - About - Disclaimer - Privacy