122 search results - page 7 / 25 » On pancyclism in hamiltonian graphs |
102
click to vote
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...
SIAMCOMP
2010
14 years 6 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
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...
105
click to vote
GC
2007
Springer
14 years 11 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
DM
2008
14 years 11 months ago
2008
Ore presented a degree condition involving every pair of nonadjacent vertices for a graph to be hamiltonian. Fan (J. Combin. Theory Ser. B 37 (1984) 221