A sublinear bound on the chromatic index of multigraphs
From MaRDI portal
Publication:1301715
DOI10.1016/S0012-365X(98)00356-2zbMath0933.05057WikidataQ128017585 ScholiaQ128017585MaRDI QIDQ1301715
Publication date: 4 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Approximating the chromatic index of multigraphs ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
Cites Work
- On the chromatic index of multigraphs and a conjecture of Seymour (I)
- Asymptotics of the chromatic index for multigraphs
- Parallel concepts in graph theory
- Edge-coloring of multigraphs: Recoloring technique
- On edge-colorings of graphs.
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- A Theorem on Coloring the Lines of a Network
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A sublinear bound on the chromatic index of multigraphs
