Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753)
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: Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs |
scientific article; zbMATH DE number 5780801
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs |
scientific article; zbMATH DE number 5780801 |
Statements
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (English)
0 references
7 September 2010
0 references
hypercube
0 references
vertex-disjoint paths
0 references
Hamiltonian path
0 references
matching
0 references
folded hypercube
0 references
interconnection network
0 references
0.853195309638977
0 references
0.8352457880973816
0 references
0.8303547501564026
0 references
0.8178083896636963
0 references
0.8086057901382446
0 references
