English

Bounds for the chromatic index of signed multigraphs

Combinatorics 2023-05-26 v2

Abstract

The paper studies edge-coloring of signed multigraphs and extends classical Theorems of Shannon and K\"onig to signed multigraphs. We prove that the chromatic index of a signed multigraph (G,σG)(G,\sigma_G) is at most 32Δ(G)\lfloor \frac{3}{2} \Delta(G) \rfloor. Furthermore, the chromatic index of a balanced signed multigraph (H,σH)(H,\sigma_H) is at most Δ(H)+1\Delta(H) + 1 and the balanced signed multigraphs with chromatic index Δ(H)\Delta(H) are characterized.

Keywords

Cite

@article{arxiv.2206.11052,
  title  = {Bounds for the chromatic index of signed multigraphs},
  author = {Eckhard Steffen and Isaak H. Wolf},
  journal= {arXiv preprint arXiv:2206.11052},
  year   = {2023}
}

Comments

8 pages