Local version of Vizing's theorem for multigraphs

DOI10.1002/JGT.23155MaRDI QIDQ6657582zbMATH OpenFDO

Authors Clinton T. Conley, Jan Grebík, Oleg Pikhurko

Publication date 6 January 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23155

zbMATH Keywords

edge colouringlocal colouringmultigraphsVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A generalization of edge-coloring in graphs
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• On fans in multigraphs
• A new method of proving theorems on chromatic index

Cites work

• Edge-colouring graphs with local list sizes
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3266380 (Why is no real title available?)
• List edge and list total colourings of multigraphs
• On an estimate of the chromatic class of a \(p\)-graph
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
• The power of multi-step Vizing chains

Cited in

(1)

• Multigraph edge-coloring with local list sizes

This page was built for publication: Local version of Vizing's theorem for multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657582)