AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal clique of two vertices, then G has a 2-factor with at most (|G|-1)/4 components. This upper bound is best possible. Additionally, we give a family of claw-free graphs with minimum degree δ⩾4 in which every 2-factor contains more than n/δ components
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...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
AbstractIn a previous paper we obtained an upper bound for the minimum number of components of a 2-f...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
In a previous paper we obtained an upper bound for the minimum number of components of a 2-factor in...
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
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...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
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...
AbstractIn this paper, we prove that if a claw-free graph G with minimum degree δ⩾4 has no maximal c...
Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. a...
AbstractIn a previous paper we obtained an upper bound for the minimum number of components of a 2-f...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
AbstractIt is showed that every simple claw-free graph of minimum degree at least 3 in which every e...
AbstractLet G be a graph of order n. Define fk(G) (Fk(G)) to be the minimum (maximum) number of comp...
In a previous paper we obtained an upper bound for the minimum number of components of a 2-factor in...
For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the followin...
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...
We consider the question of the range of the number of cycles possible in a 2-factor of a 2-connecte...
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...
DOI
Add to ORKG