Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243)
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: Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3 |
scientific article; zbMATH DE number 1524843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) |
scientific article; zbMATH DE number 1524843 |
Statements
Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (English)
0 references
2 November 2000
0 references
edge coloring
0 references
multigraph
0 references
edge chromatic number
0 references
0.8221625089645386
0 references
0.8166118264198303
0 references
0.8152590990066528
0 references
0.8141422867774963
0 references
