Add to ORKGWe show that every hamiltonian claw-free graph with a ver-tex x of degree d(x) ≥ 7 has a 2-factor consisting of exactly two cycles.
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractWe prove the following generalization of a result of Faudree and van den Heuvel. Let G be a ...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
For a non-hamiltonian claw-free graph $G$ with order $n$ and minimum degree $\delta$ we show the fol...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
AbstractThe connected forbidden subgraphs and pairs of connected forbidden subgraphs that imply a 2-...
AbstractPairs of connected graphs X,Y such that a graph G is 2-connected and XY-free implies that G ...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamilto...
AbstractWe introduce a closure concept for 2-factors in claw-free graphs that generalizes the closur...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractWe prove the following generalization of a result of Faudree and van den Heuvel. Let G be a ...
A well known generalisation of Dirac's theorem states that if a graph G on n≥4k vertices has minimum...
AbstractIn this paper we study the minimum degree condition for a Hamiltonian graph to have a 2-fact...
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
For a non-hamiltonian claw-free graph $G$ with order $n$ and minimum degree $\delta$ we show the fol...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
AbstractThe connected forbidden subgraphs and pairs of connected forbidden subgraphs that imply a 2-...
AbstractPairs of connected graphs X,Y such that a graph G is 2-connected and XY-free implies that G ...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
A necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which inc...
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamilto...
AbstractWe introduce a closure concept for 2-factors in claw-free graphs that generalizes the closur...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
AbstractIn this paper we generalize a Theorem of Jung which shows that 1-tough graphs with δ(G)⩾|V(G...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractWe prove the following generalization of a result of Faudree and van den Heuvel. Let G be a ...