2000 character limit reached
Bounds for the chromatic index of signed multigraphs
Published 22 Jun 2022 in math.CO | (2206.11052v2)
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,\sigma_G)$ is at most $\lfloor \frac{3}{2} \Delta(G) \rfloor$. Furthermore, the chromatic index of a balanced signed multigraph $(H,\sigma_H)$ is at most $\Delta(H) + 1$ and the balanced signed multigraphs with chromatic index $\Delta(H)$ are characterized.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.