Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
