A better than “best possible” algorithm to edge color multigraphs (Q3725544): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(86)90039-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2140029748 / rank | |||
Normal rank | |||
Latest revision as of 21:08, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better than “best possible” algorithm to edge color multigraphs |
scientific article |
Statements
A better than “best possible” algorithm to edge color multigraphs (English)
0 references
1986
0 references
graph algorithm
0 references
edge coloring
0 references
