A conditional greedy algorithm for edge-coloring
Combinatorics
2017-06-15 v1
Abstract
We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with ( is the chromatic edge number and is the maximum vertex degree) would prove a long standing conjecture in edge-coloring of multigraphs.
Keywords
Cite
@article{arxiv.1706.04476,
title = {A conditional greedy algorithm for edge-coloring},
author = {Mark K. Goldberg},
journal= {arXiv preprint arXiv:1706.04476},
year = {2017}
}
Comments
4 pages