Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:24, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings |
scientific article |
Statements
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (English)
0 references
29 May 2007
0 references
matching
0 references
colouring
0 references
bipartite graphs
0 references
