Number of the records: 1  

Almost all Graphs with 1.44n Edges Are 3-Colourable

  1. InfoRETRO-CATALOGUING - SHORT RECORD
    Title Almost all Graphs with 1.44n Edges Are 3-Colourable
    Author infoV. Chvátal
    Author Chvátal V.
    Issue dataBonn : Inst. für Operations Research , 1989. - 19 s.
    Issue1. ed.
    Edition Report , No.89602-OR
    Document kindsprávy výskumné
    LanguageEnglish
    Country of EditionGermany
    systematics 519.1 - Kombinatorika. Teória grafov
    DatabaseBOOKS
    Copy count1, currently available 1, at library only 0
    Call number641826

    Call numberLocationSublocationInfo
    641826SEKSklad 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.