Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 02:50, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs |
scientific article |
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
