Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs (Q991753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.12.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070296036 / rank | |||
Normal rank | |||
Revision as of 02:18, 20 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
