On the number of components in 2-factors of claw-free graphs (Q2461206): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.11.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074114001 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of components in 2-factors of claw-free graphs |
scientific article |
Statements
On the number of components in 2-factors of claw-free graphs (English)
0 references
27 November 2007
0 references
The author proves that every bridgeless claw-free graph \(G\) with the minimum degree \(\delta\geq 4\) has a 2-factor with at most \((n-1)/4\) components, where \(n\) is the order of \(G\). This upper bound is best possible. Additionally, a family of claw-free graphs with minimum degree \(\delta\geq 4\) in which every 2-factor contains more than \(n/\delta\) components is constructed.
0 references
claw-free graph
0 references
line-graph
0 references
2-factor
0 references
