Local version of Vizing's theorem for multi-graphs
Combinatorics
2024-05-03 v2
Abstract
Extending a result of Christiansen, we prove that every mutli-graph admits a proper edge colouring which is local, that is, for every edge with end-points , where (resp.\ ) denotes the degree of a vertex (resp.\ the maximum edge multiplicity at ). This is derived from a local version of the Fan Equation.
Keywords
Cite
@article{arxiv.2306.04173,
title = {Local version of Vizing's theorem for multi-graphs},
author = {Clinton T. Conley and Jan Grebik and Oleg Pikhurko},
journal= {arXiv preprint arXiv:2306.04173},
year = {2024}
}
Comments
10 pages, minor revision