1. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1–3), 3–44 (1998)
2. Baum, S., Trotter, L.E.: Optimization and operations research. In: Proceedings of a Workshop Held at the University of Bonn, October 2–8, 1977, chapter Integer rounding and polyhedral decomposition for totally unimodular systems, pp. 15–23. Springer Berlin Heidelberg, (1978)
3. Carr, R.D., Konjevod, G.: Polyhedral combinatorics. In: Greenberg, H. (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research, pp. 1–48. Springer, Berlin (2004)
4. Conforti, M., Cornuéjols, G., Vušković, K.: Balanced matrices. Discrete Math. 306(19–20), 2411–2437 (2006)
5. Eggan, L., Plantholt, M.: The chromatic index of nearly bipartite multigraphs. J. Comb. Theory Ser. B 40(1), 71–80 (1986)