A conditional greedy algorithm for edge-coloring

Autor:	Goldberg, Mark K.
Rok vydání:	2017
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with $\chi' > \Delta +1$ ($\chi'$ is the chromatic edge number and $\Delta$ is the maximum vertex degree) would prove a long standing conjecture in edge-coloring of multigraphs. Comment: 4 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1706.04476 Zobrazit plný text záznamu View this record from Arxiv