Number of the records: 1  

The Complexity of Recognizing Weakly Triangulated Graphs That Are Perfectly Orderable

  1. InfoRETRO-CATALOGUING - SHORT RECORD
    Title The Complexity of Recognizing Weakly Triangulated Graphs That Are Perfectly Orderable
    Author infoChính T. Hoáng
    Author Hoáng Chính T.
    Issue dataBonn : Inst. für Ökonometrie und Operations Research , 1990. - 7 s.
    Issue1. ed.
    Edition Report , No.90638 - OR
    Document kindsprávy výskumné (v knižnej podobe)
    LanguageEnglish
    Country of EditionGermany
    systematics 519.1 - Kombinatorika. Teória grafov
    DatabaseBOOKS
    Copy count1, currently available 1, at library only 0
    Call number655758

    Call numberLocationSublocationInfo
    655758SEKSklad knižničného fonduavailaible

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.