Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243)
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: Maximal k-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture |
scientific article |
Statements
Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (English)
0 references
10 May 2017
0 references
edge coloring
0 references
Vizing's theorem
0 references
Tuza's conjecture
0 references
\(k\)-edge-colorable subgraph
0 references
\(k\)-dependent set
0 references
0 references
0.8124067187309265
0 references
0.8080610036849976
0 references
0.8080610036849976
0 references
0.8051614761352539
0 references
0.8051614761352539
0 references
