A simple and fast heuristic algorithm for edge-coloring of graphs

zbMath1301.05122arXiv1210.5176MaRDI QIDQ2443421

Yanyan Li

Publication date: 7 April 2014

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.5176

zbMATH Keywords

edge-coloringcubic graphregular graphsnarkheuristic algorithmconflicting vertex

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Measures of edge-uncolorability of cubic graphs ⋮ ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS ⋮ Some results on the structure of multipoles in the study of snarks

This page was built for publication: A simple and fast heuristic algorithm for edge-coloring of graphs