Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652)
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: Bipartite double cover and perfect 2-matching covered graph with its algorithm |
scientific article; zbMATH DE number 6463955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite double cover and perfect 2-matching covered graph with its algorithm |
scientific article; zbMATH DE number 6463955 |
Statements
Bipartite double cover and perfect 2-matching covered graph with its algorithm (English)
0 references
24 July 2015
0 references
bipartite double cover
0 references
perfect 2-matching covered graph
0 references
1-extendable graph
0 references
minimally perfect 2-matching covered graph
0 references
minimally 1-extendable graph
0 references
algorithm
0 references
0.8161969780921936
0 references
0.8087056875228882
0 references
0.787574052810669
0 references
0.7834354043006897
0 references
0.7736969590187073
0 references
