On the number of components in 2-factors of claw-free graphs (Q2461206)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5214677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of components in 2-factors of claw-free graphs |
scientific article; zbMATH DE number 5214677 |
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
0.98617804
0 references
0.9750791
0 references
0 references
0.96027535
0 references
0 references
0 references
0.9591163
0 references
0.9410471
0 references
0.9393014
0 references
