Achieving maximum chromatic index in multigraphs

DOI10.1016/J.DISC.2008.04.023MaRDI QIDQ1025461zbMATH OpenOpenAlexFDO

Authors J. M. Mcdonald

Publication date 19 June 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.04.023

zbMATH Keywords

chromatic indexGoldberg's upper boundmultigraphodd-girthsubgraphVizing's upper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• On Vizing's bound for the chromatic index of a multigraph
• Approximating the chromatic index of multigraphs
• scientific article; zbMATH DE number 3918395
• A note concerning the chromatic index of multigraphs
• On characterizing Vizing's edge colouring bound

Cites work

• 25 pretty graph colouring problems
• A Theorem on Coloring the Lines of a Network
• Edge-coloring of multigraphs: Recoloring technique
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• scientific article; zbMATH DE number 3470445 (Why is no real title available?)
• scientific article; zbMATH DE number 1534644 (Why is no real title available?)
• scientific article; zbMATH DE number 1560509 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• 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

(10)

• On Vizing's bound for the chromatic index of a multigraph
• The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
• A refinement of Vizing's theorem
• Edge coloring multigraphs without small dense subsets
• On a limit of the method of Tashkinov trees for edge-colouring
• On characterizing Vizing's edge colouring bound
• On a theorem of Goldberg
• A characterization of multigraphs reaching Goldberg's bound of chromatic index
• A backtracking algorithm for solving the nearly equitable strong edge-coloring problem on transportation network
• On multiples of simple graphs and Vizing's theorem

This page was built for publication: Achieving maximum chromatic index in multigraphs

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