Edge-coloring almost bipartite multigraphs

DOI10.1016/j.ipl.2013.06.006zbMath1285.05058OpenAlexW2045762363MaRDI QIDQ2444912

Tomás Feder, Carlos Subi

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.006

zbMATH Keywords

combinatorial problemsedge coloringchromatic indexgraph matchinglist edge cloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic index of nearly bipartite multigraphs
• Tutte's edge-colouring conjecture
• The list chromatic index of a bipartite multigraph
• List edge colourings of some 1-factorable multigraphs
• The NP-Completeness of Edge-Coloring
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Stable networks and product graphs
• Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
• College Admissions and the Stability of Marriage

This page was built for publication: Edge-coloring almost bipartite multigraphs