The number of disjoint perfect matchings in semi-regular graphs (Q5034273)
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: The number of disjoint perfect matchings in semi-regular graphs |
scientific article; zbMATH DE number 7481043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of disjoint perfect matchings in semi-regular graphs |
scientific article; zbMATH DE number 7481043 |
Statements
The number of disjoint perfect matchings in semi-regular graphs (English)
0 references
24 February 2022
0 references
semiregular graph
0 references
Hamiltonian graph
0 references
regular graph
0 references
perfect matching
0 references
factorization
0 references
0 references
0.8703567981719971
0 references
0.8528603911399841
0 references
0.8197261691093445
0 references
0.8118315935134888
0 references
