Edge coloring of graphs of signed class 1 and 2
Abstract
Recently, Behr introduced a notion of the chromatic index of signed graphs and proved that for every signed graph , it holds that where is the maximum degree of and denotes its chromatic index. In general, the chromatic index of , depends on both the underlying graph and the signature . In the paper we study graphs for which , does not depend on . To this aim we introduce two new classes of graphs, namely and , such that graph is of class (respectively, ) if and only if , (respectively, , ) for all possible signatures . We prove that all wheels, necklaces, complete bipartite graphs with and almost all cacti graphs are of class . Moreover, we give sufficient and necessary conditions for a graph to be of class , i.e. we show that these graphs must have odd maximum degree and give examples of such graphs with arbitrary odd maximum degree bigger that .
Cite
@article{arxiv.2205.15425,
title = {Edge coloring of graphs of signed class 1 and 2},
author = {Robert Janczewski and Krzysztof Turowski and Bartłomiej Wróblewski},
journal= {arXiv preprint arXiv:2205.15425},
year = {2023}
}