A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

DOI10.1002/jgt.21670zbMath1269.05040arXiv1012.5003OpenAlexW2110489378MaRDI QIDQ5325936

Michael J. Plantholt

Publication date: 31 July 2013

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

Full work available at URL: https://arxiv.org/abs/1012.5003

zbMATH Keywords

multigraphchromatic indexfractional chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Graph edge coloring: a survey ⋮ Edge coloring multigraphs without small dense subsets ⋮ Goldberg's conjecture is true for random multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the chromatic index of multigraphs
• Graph edge colouring: Tashkinov trees and Goldberg's conjecture
• On the chromatic index of multigraphs and a conjecture of Seymour (I)
• Asymptotics of the chromatic index for multigraphs
• A sublinear bound on the chromatic index of multigraphs
• Edge-coloring of multigraphs: Recoloring technique
• On edge-colorings of graphs.
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On fans in multigraphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: A Combined Logarithmic Bound on the Chromatic Index of Multigraphs