Densities, Matchings, and Fractional Edge-Colorings

DOI10.1137/17M1147676zbMath1410.90175OpenAlexW2911660041WikidataQ128585924 ScholiaQ128585924MaRDI QIDQ4620419

Wenan Zang, Xu-jin Chen, Qiu-Lan Zhao

Publication date: 8 February 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1147676

zbMATH Keywords

multigraphalgorithmmatchingdensityfractional edge-coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (2)

Co-density and fractional edge cover packing ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving a family of approximation algorithms to edge color multigraphs
• On a limit of the method of Tashkinov trees for edge-colouring
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• On the chromatic index of multigraphs without large triangles
• The ellipsoid method and its consequences in combinatorial optimization
• A polyhedral approach to edge coloring
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimizing submodular functions over families of sets
• Edge-coloring of multigraphs: Recoloring technique
• Fractional covers for forests and matchings
• Odd Minimum Cut Sets and b-Matchings Revisited
• A new approach to the maximum-flow problem
• Multi-Terminal Network Flows
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• 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: Densities, Matchings, and Fractional Edge-Colorings