Perfect matchings avoiding prescribed edges in a star-free graph (Q2515564)
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 avoiding prescribed edges in a star-free graph |
scientific article; zbMATH DE number 6470561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matchings avoiding prescribed edges in a star-free graph |
scientific article; zbMATH DE number 6470561 |
Statements
Perfect matchings avoiding prescribed edges in a star-free graph (English)
0 references
5 August 2015
0 references
perfect matching
0 references
forbidden subgraph
0 references
star-free graphs
0 references
extendability
0 references
0.9448737502098083
0 references
0.8373744487762451
0 references
0.8199334740638733
0 references
0.8092576861381531
0 references
0.8056232333183289
0 references
