Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.