A simple and fast heuristic algorithm for edge-coloring of graphs (Q2443421)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and fast heuristic algorithm for edge-coloring of graphs |
scientific article |
Statements
A simple and fast heuristic algorithm for edge-coloring of graphs (English)
0 references
7 April 2014
0 references
cubic graph
0 references
regular graph
0 references
edge-coloring
0 references
snark
0 references
conflicting vertex
0 references
heuristic algorithm
0 references
