17 search results - page 3 / 4 » Pancyclicity in claw-free graphs |
105
click to vote
JCT
2010
14 years 10 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
102
Voted
IPL
2002
14 years 11 months ago
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 an...
78
Voted
DM
2002
14 years 11 months ago
2002
In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with minimum degree...
101
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
54
Voted
DM
2002
14 years 11 months ago
2002
