On characterizing Vizing's edge colouring bound
From MaRDI portal
Publication:3113286
DOI10.1002/jgt.20571zbMath1242.05096MaRDI QIDQ3113286
Jessica McDonald, Penny E. Haxell
Publication date: 8 February 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20571
05C15: Coloring of graphs and hypergraphs
Related Items
Graph edge coloring: a survey, The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \), Structural properties of edge-chromatic critical multigraphs, Edge coloring multigraphs without small dense subsets
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating the chromatic index of multigraphs
- On the chromatic index of multigraphs without large triangles
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Achieving maximum chromatic index in multigraphs
- On Vizing's bound for the chromatic index of a multigraph
- A refinement of Vizing's theorem
- On the fractional chromatic index of a graph and its complement
- The NP-Completeness of Edge-Coloring
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Maximum matching and a polyhedron with 0,1-vertices
- A Theorem on Coloring the Lines of a Network