arXiv (All)
open access
Vizing's theorem for signed multigraphs
We prove that every finite loopless signed multigraph $Σ=(G,σ)$ satisfies $χ'(Σ)\leqΔ(G)+μ(G)$, where $χ'(Σ)$ is its chromatic index, and $Δ(G)$ and $μ(G)$ are the maximum degree and maximum multiplicity of $G$, respectively. This bound is sharp, even when both positive and negative edges are presen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Local Clique Covers and Chromatic Number#985390
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- Intersections of Oriented Graphs and Tournaments#974583
- Diameter and radius of an additive-multiplicative graph#1144314
Record · ID 1117820
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive