131 search results - page 2 / 27 » 2-Factors in Hamiltonian Graphs |
111
click to vote
JGT
2007
15 years 1 months ago
2007
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
JCT
2008
15 years 1 months ago
2008
A graph is pseudo 2
122
Voted
JGT
2010
15 years 9 days ago
2010
In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it was shown that the minimum degree condition can be ...
115
Voted
GC
2010
Springer
14 years 11 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
123
click to vote
DAM
2007
15 years 1 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...