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
- HOÁNG, G.T. On the Two-edge-colourings of Perfect Graphs. 1. ed. Bonn : Inst. für Operations Research, 1989. 9 s. Report, No.89603-OR. [Copy count : 1, currently available 1, at library only 0]
book
- BARAHONA, Francisco. On Some Applications of the Chinese Postman Problem. 1. ed. Bonn : Inst. für Operations Research, 1988. 18 s. Report, No.89559-OR. [Copy count : 1, currently available 1, at library only 0]
book
- ROBERTSON, Neil - SEYMOUR, Paul. An Outline of a Disjoint Paths Algorithm. 1. ed. Bonn : Inst. für Operations Research, 1988. 27 s. Report, No.88523-OR. [Copy count : 2, currently available 2, at library only 0]
book
- LOMONOSOV, Michael V. Cycles Through Prescribed Elements in a Graph. 1. ed. Bonn : Inst. für Operations Research, 1988. 20 s. Report, No.88533-OR. [Copy count : 2, currently available 2, at library only 0]
book
- KAUFMANN, Michael - MEHLHORN, Kurt. Routing Problems in Grid Graphs. 1. ed. Bonn : Inst. für Operations Research, 1988. 21 s. Report, No.89561-OR. [Copy count : 1, currently available 1, at library only 0]
book