131 search results - page 8 / 27 » 2-Factors in Hamiltonian Graphs |
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
ARSCOM
2004
13 years 7 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
COCOON
2003
Springer
14 years 19 days ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
JCT
2006
13 years 7 months ago
2006
Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if...
EJC
2006
13 years 7 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)