Perfect 0, ± 1 matrices

Linear Algebra and Its Applications

Volumn 253, Issue 1-3, 1997, Pages 299-309

  Conforti, Michele ^a   Cornuéjols, Gérard ^b   De Francesco, Carla ^a  

^a UNIVERSITY OF PADOVA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000063296     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00773-2     Document Type: Article

References (8)

1. C. Berge, Färbung von Graphen deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung), Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math.-Natuwiss. Reihe, 1961, pp. 114-115.
2. M. Conforti and G. Cornuéjols, Balanced 0, ± 1 matrices, bicoloring and total dual integrality, Math. Programming, 71 (1995) 249-258.
3. M. Conforti, G. Cornuéjols, A. Kapoor, M. R. Rao, and K. Vǔsković, Balanced matrices, in Mathematical Programming: State of the Art 1994, J. R. Birge and K. G. Murty, Eds., Univ. of Michigan Press, 1994, pp. 1-33.
4. J. N. Hooker, Resolution and the Integrality of Satisfiability Polytopes, GSIA Working Paper, Carnegie Mellon University, 1992.
5. L. Lovász, A characterization of perfect graphs, J. Combin. Theory Ser. B 13:95-98 (1972).
6. M. W. Padberg, Perfect zero-one matrices, Math. Programming 6:180-96 (1974).
7. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
8. K. Truemper, Alpha-balanced graphs and matrices and GF(3)-representability of matroids, J. Combin. Theory Ser. B 55:112-139 (1982).