On characterizing Vizing's edge colouring bound
From MaRDI portal
Publication:3113286
Recommendations
Cites work
- scientific article; zbMATH DE number 1560509 (Why is no real title available?)
- A Theorem on Coloring the Lines of a Network
- A refinement of Vizing's theorem
- Achieving maximum chromatic index in multigraphs
- Approximating the chromatic index of multigraphs
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Maximum matching and a polyhedron with 0,1-vertices
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- On Vizing's bound for the chromatic index of a multigraph
- On the chromatic index of multigraphs without large triangles
- On the fractional chromatic index of a graph and its complement
- The NP-Completeness of Edge-Coloring
Cited in
(14)- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)
- On a theorem of Goldberg
- On Vizing's bound for the chromatic index of a multigraph
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- A generalization of edge-coloring in graphs
- Graph edge coloring: a survey
- Edge coloring multigraphs without small dense subsets
- Structural properties of edge-chromatic critical multigraphs
- Kőnig's line coloring and Vizing's theorems for graphings
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- Achieving maximum chromatic index in multigraphs
- Beyond the Vizing's bound for at most seven colors
- A Vizing-like theorem for union vertex-distinguishing edge coloring
This page was built for publication: On characterizing Vizing's edge colouring bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113286)
