On Vizing's bound for the chromatic index of a multigraph
From MaRDI portal
Publication:1044923
DOI10.1016/j.disc.2008.04.046zbMath1216.05038OpenAlexW2063149200MaRDI QIDQ1044923
Michael Stiebitz, Diego Scheide
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.046
Related Items (6)
Extension from precoloured sets of edges ⋮ The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Graph edge coloring: a survey ⋮ Vizing's coloring algorithm and the fan number ⋮ On characterizing Vizing's edge colouring bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Critical star multigraphs
- Edge-coloring of multigraphs: Recoloring technique
- On the $1.1$ Edge-Coloring of Multigraphs
- The NP-Completeness of Edge-Coloring
- 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
This page was built for publication: On Vizing's bound for the chromatic index of a multigraph
