On characterizing Vizing's edge colouring bound

DOI10.1002/JGT.20571zbMATH Open1242.05096OpenAlexW2074364524MaRDI QIDQ3113286FDOQ3113286

Authors: Penny Haxell, Jessica McDonald 

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

Recommendations

• On Vizing's bound for the chromatic index of a multigraph
• On a theorem of Goldberg
• A generalization of edge-coloring in graphs
• Achieving maximum chromatic index in multigraphs
• Edge coloring multigraphs without small dense subsets

zbMATH Keywords

multigraphedge colouringVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The NP-Completeness of Edge-Coloring
• Maximum matching and a polyhedron with 0,1-vertices
• Achieving maximum chromatic index in multigraphs
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)
• On the chromatic index of multigraphs without large triangles
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• A Theorem on Coloring the Lines of a Network
• On the fractional chromatic index of a graph and its complement
• Approximating the chromatic index of multigraphs
• A refinement of Vizing's theorem
• On Vizing's bound for the chromatic index of a multigraph

Cited In (14)

• Kőnig's line coloring and Vizing's theorems for graphings
• A generalization of edge-coloring in graphs
• Edge coloring multigraphs without small dense subsets
• Achieving maximum chromatic index in multigraphs
• On a theorem of Goldberg
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
• Structural properties of edge-chromatic critical multigraphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• On Vizing's bound for the chromatic index of a multigraph
• A Vizing-like theorem for union vertex-distinguishing edge coloring
• Graph edge coloring: a survey
• Beyond the Vizing's bound for at most seven colors
• Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture

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)