Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\) (Q2892425)
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: Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\) |
scientific article; zbMATH DE number 6047515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\) |
scientific article; zbMATH DE number 6047515 |
Statements
18 June 2012
0 references
edge-colored graph
0 references
heterochromatic matching
0 references
complete bipartite graph
0 references
complete graph
0 references
0.89626294
0 references
0.8908024
0 references
0.8829517
0 references
0.8788598
0 references
0 references
0 references
0.8740102
0 references
0.8729569
0 references
Maximum heterochromatic matchings in complete bipartite graph \(K_{n,m}\) and complete graph \(K_{2n}\) (English)
0 references
