Perfect matchings and \(K_{1,p}\)-restricted graphs (Q1996835)
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: Perfect matchings and K₁,p-restricted graphs |
scientific article; zbMATH DE number 7316005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matchings and \(K_{1,p}\)-restricted graphs |
scientific article; zbMATH DE number 7316005 |
Statements
Perfect matchings and \(K_{1,p}\)-restricted graphs (English)
0 references
26 February 2021
0 references
strongly \(K_{1, p}\)-restricted graph
0 references
perfect matching
0 references
factor-critical graph
0 references
0.8528711795806885
0 references
0.8275049924850464
0 references
0.8251273036003113
0 references
0.8126633763313293
0 references
