Computing sharp 2-factors in claw-free graphs (Q988693)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing sharp 2-factors in claw-free graphs |
scientific article; zbMATH DE number 5772514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing sharp 2-factors in claw-free graphs |
scientific article; zbMATH DE number 5772514 |
Statements
Computing sharp 2-factors in claw-free graphs (English)
0 references
18 August 2010
0 references
claw-free graph
0 references
2-factor
0 references
number of components
0 references
polynomial algorithm
0 references
0 references
0.9967060089111328
0 references
0.9050693511962892
0 references
0.9050693511962892
0 references
0.882864773273468
0 references
0.8826766014099121
0 references
