Fast algorithms for Vizing's theorem on bounded degree graphs (Q6930173)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8093405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for Vizing's theorem on bounded degree graphs |
scientific article; zbMATH DE number 8093405 |
Statements
Fast algorithms for Vizing's theorem on bounded degree graphs (English)
0 references
16 September 2025
0 references
edge-coloring
0 references
Vizing's theorem
0 references
linear-time algorithm
0 references
distributed algorithm
0 references
\( \mathsf{LOCAL}\) model
0 references
0 references
0 references
0 references
0 references
