1. The Complexity of Recognizing Weakly Triangulated Graphs That Are Perfectly Orderable
:HOÁNG, Chính T. The Complexity of Recognizing Weakly Triangulated Graphs That Are Perfectly Orderable. 1. ed. Bonn : Inst. für Ökonometrie und Operations Research, 1990. 7 s. Report, No.90638 - OR. [Copy count : 1, currently available 1, at library only 0]