For a non-hamiltonian claw-free graph $G$ with order $n$ and minimum degree $\delta$ we show the following. If $\delta=4$, then $G$ has a 2-factor with at most $(5n-14)/18$ components, unless $G$ belongs to a finite class of exceptional graphs. If $\delta \ge 5$, then $G$ has a 2-factor with at most $(n-3)/(\delta -1)$ components. These bounds are sharp in the sense that we can replace nor 5/18 by a smaller quotient nor $\delta -1$ by $\delta$
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
We show that every hamiltonian claw-free graph with a ver-tex x of degree d(x) ≥ 7 has a 2-factor c...
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graph
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
Let $G$ be a claw-free graph with order $n$ and minimum degree $\delta$. We improve results of Faudr...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
AbstractIn a previous paper we obtained an upper bound for the minimum number of components of a 2-f...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
We show that every hamiltonian claw-free graph with a ver-tex x of degree d(x) ≥ 7 has a 2-factor c...
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graph
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
Let $G$ be a claw-free graph with order $n$ and minimum degree $\delta$. We improve results of Faudr...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
AbstractIn a previous paper we obtained an upper bound for the minimum number of components of a 2-f...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
We show that every hamiltonian claw-free graph with a ver-tex x of degree d(x) ≥ 7 has a 2-factor c...
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graph
DOI
Add to ORKG