vix.ing · top · new · best · stats · spec

A conditional greedy algorithm for edge-coloring

2017/06/14 by Mark Goldberg, Goldberg, Mark K.
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1706.04476

openalex publication_date 2017/06/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a novel algorithm for edge-coloring of multigraphs. The correctness of this algorithm for multigraphs with χ' > Δ+1 (χ' is the chromatic edge number and Δ is the maximum vertex degree) would prove a long standing conjecture in edge-coloring of multigraphs.

Citations

Related