On a Binary-Encoded ILP Coloring Formulation

References

• Avis D., Fukuda K. Reverse search for enumeration. Discrete Appl. Math. (1996) 65:21–46Crossref, Google Scholar
• Chetwynd A. G., Wilson R. J. The rise and fall of the critical graph conjecture. J. Graph Theory (1983) 7:153–157Crossref, Google Scholar
• Coppersmith D., Lee J. Parsimonious binary-encoding in integer programming. Discrete Optim. (2005) 2:190–200Crossref, Google Scholar
• Holyer I. The NP-completeness of edge-coloring. SIAM J. Comput. (1981) 10:718–720Crossref, Google Scholar
• Lee J. All-different polytopes. J. Combin. Optim. (2002) 6:335–352Crossref, Google Scholar
• Lee J., Margot F., Bienstock D., Nemhauser G. More on a binary-encoded coloring formulation. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science (2004) 3064(Springer-Verlag, Berlin, Germany) 271–282Crossref, Google Scholar
• Lee J., Leung J., de Vries S. Separating type-I odd-cycle inequalities for a binary encoded edge-coloring formulation. J. Combin. Optim. (2005) 9:59–67Crossref, Google Scholar
• Vazirani V. V. A theory of alternating paths and blossoms for proving correctness of the O(√V E) general graph maximum matching algorithm. Combinatorica (1994) 14:71–109Crossref, Google Scholar
• Vizing V. G. On an estimate of the chromatic class of a p-graph. Diskret. Analiz No. (1964) 3:25–30Google Scholar