Partition a graph with small diameter into two induced matchings (Q2501435)
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: Partition a graph with small diameter into two induced matchings
scientific article; zbMATH DE number 5052132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partition a graph with small diameter into two induced matchings |
scientific article; zbMATH DE number 5052132 |
Statements
Partition a graph with small diameter into two induced matchings (English)
0 references
11 September 2006
0 references
induced matching
0 references
0.8647221326828003
0 references
0.7956833839416504
0 references
0.7877274751663208
0 references
0.7749362587928772
0 references
0.774678111076355
0 references
