Search results
- CHVÁTAL, V. Almost all Graphs with 1.44n Edges Are 3-Colourable. 1. ed. Bonn : Inst. für Operations Research, 1989. 19 s. Report, No.89602-OR. [Copy count : 1, currently available 1, at library only 0]
book
- CHVÁTAL, V. - SUN, L. Recognizing Dart-Free Perfect Graphs. 1. ed. Bonn : Inst. für Ökon. und Operations Research, 1989. 31 s. Report, No.89606-OR. [Copy count : 1, currently available 1, at library only 0]
book
- CHVÁTAL, V. Which Line-Graphs Are Perfectly Orderable? 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1989. 4 s. Report, No.89562 - OR. [Copy count : 1, currently available 1, at library only 0]
book
- CHVÁTAL, V. Cutting - plane proofs and the stability number of a graph. Bonn : Institut für Ökonometrie und Operations Research, 1984. 10 s. Report, no. 84326. [Copy count : 1, currently available 1, at library only 0]
book
- CHVÁTAL, V. Cutting planes in combinatorics. 1. ed. Bonn : Institut für Ökonometrie und Operations Research, 1984. 13 s. Report, no. 84325 - OR. [Copy count : 1, currently available 1, at library only 0]
book