Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389)
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: Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings |
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
