On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239)
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: On maximum k-edge-colorable subgraphs of bipartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On maximum \(k\)-edge-colorable subgraphs of bipartite graphs |
scientific article |
Statements
On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (English)
0 references
11 March 2019
0 references
edge-coloring
0 references
bipartite graph
0 references
\(k\)-edge-colorable subgraph
0 references
maximum \(k\)-edge-colorable subgraph
0 references
0 references
0.8139839768409729
0 references
0.8025070428848267
0 references
0.7879494428634644
0 references
0.7818076610565186
0 references
0.7783055305480957
0 references
