Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2005.06.091 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086313390 / rank | |||
Normal rank | |||
Revision as of 18:08, 19 March 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
