Densities, Matchings, and Fractional Edge-Colorings

Given a multigraph $G=(V,E)$ with a positive rational weight $w(e)$ on each edge $e$, the weighted density problem (WDP) is to find a subset $U$ of $V$, with $|U|\ge 3$ and odd, that maximizes $2w(...

[1]  Tommy R. Jensen,et al.  Unsolved Graph Colouring Problems , 2015 .

[2]  William Sean Kennedy,et al.  Fractional Edge and Total Colouring , 2011 .

[3]  Michael Stiebitz,et al.  Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture , 2012 .

[4]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[5]  Michel X. Goemans,et al.  Minimizing submodular functions over families of sets , 1995, Comb..

[6]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[7]  M. R. Rao,et al.  Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[8]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[9]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[10]  Manfred W. Padberg,et al.  Fractional covers for forests and matchings , 1984, Math. Program..

[11]  Alberto Caprara,et al.  Improving a Family of Approximation Algorithms to Edge Color Multigraphs , 1998, Inf. Process. Lett..

[12]  Hal A. Kierstead,et al.  On the chromatic index of multigraphs without large triangles , 1984, J. Comb. Theory, Ser. B.

[13]  Douglas B. West.  A short proof of the Berge-Tutte Formula and the Gallai-Edmonds Structure Theorem , 2011, Eur. J. Comb..

[14]  Jessica McDonald,et al.  On a limit of the method of Tashkinov trees for edge-colouring , 2016, Discret. Math..

[15]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[16]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[17]  Martin Grötschel,et al.  Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” , 1984, Comb..

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[19]  P. D. Seymour,et al.  On Multi‐Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte , 1979 .

[20]  Mark K. Goldberg,et al.  Edge-coloring of multigraphs: Recoloring technique , 1984, J. Graph Theory.