On the chromatic index of multigraphs and a conjecture of Seymour (I)

DOI10.1016/0095-8956(86)90053-5zbMath0605.05012OpenAlexW1972212864MaRDI QIDQ1084107

Odile Marcotte

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90053-5

zbMATH Keywords

chromatic indexSeymour's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Colouring series-parallel graphs ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ The chromatic index of multigraphs of order at most 10 ⋮ Approximating the chromatic index of multigraphs ⋮ A sublinear bound on the chromatic index of multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-coloring of multigraphs: Recoloring technique
• Integer Rounding for Polymatroid and Branching Optimization Problems
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On the chromatic index of multigraphs and a conjecture of Seymour (I)