Results 91 to 100 of about 1,777 (160)
The Directed Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Directed Graphs of Odd Order [PDF]
, 2002 Brett Stevens
openalex +1 more source
Discrete Applied Mathematics, 2013 We introduce the class of (2)-pancyclic graphs, which are simple undirected finite connected graphs of order n having exactly two cycles of length p for each p satisfying [email protected][email protected]?n, analyze their properties, and give several examples of such graphs, among which are the smallest.
openaire +2 more sources
Resilient Pancyclicity of Random and Pseudorandom Graphs [PDF]
, 2010 Michael Krivelevich +2 more
openalex +1 more source
An ore-type condition implying a digraph to be pancyclic
, 1977 Carsten Thomassen
openalex +1 more source
PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS [PDF]
, 2014 Yubao Guo, Michel Surmacs
openalex +1 more source
On pancyclism of hamiltonian graphs
Electronic Notes in Discrete Mathematics, 2000 Abstract Let n and Δ be two integers with Δ ≤ n − 1. We study the set of cycle lengths occurring in any hamiltonian graph G of order n and maximum degree Δ. We show that for the case n/2+1 ≤ Δ ≤ 2n-2/3 this set contains all the integers belonging to the union [3, 2Δ-n+2] ∪ [n-Δ+ 2,Δ+1], and for 2n−2 3 ≤ Δ ≤ n − 1 it contains every integer ...
openaire +2 more sources
A SUFFICIENT CONDITION FOR PANCYCLIC GRAPHS
Bulletin of the Australian Mathematical SocietyAbstract A graph G is called an $[s,t]$ -graph if any induced subgraph of G of order s has size at least $t.$ We prove that every $2$ -connected $[4,2]$ -graph of order at least $7$ is pancyclic.
openaire +2 more sources
Hamiltonian degree conditions which imply a graph is pancyclic
, 1990 Douglas C. Bauer, E. F. Schmeichel
openalex +1 more source
Vertex pancyclicity in quasi-claw-free graphs
, 2008 Ellen X. Y. Qu, Wang Jiang-lu
openalex +1 more source