Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1510.07017 / rank | |||
Normal rank |
Revision as of 15:52, 18 April 2024
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