Edge coloring signed graphs

https://doi.org/10.1016/j.disc.2019.111654Get rights and content
Under an Elsevier user license
open archive

Abstract

We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it has a natural definition in terms of vertex coloring of a line graph, and the minimum number of colors required for a proper coloring of a signed simple graph is bounded above by Δ+1 in parallel with Vizing’s Theorem. In fact, Vizing’s Theorem is a special case of the more difficult theorem concerning signed graphs.

Keywords

Signed graph
Edge coloring
Vizing

Cited by (0)