Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Graphs of degree 4 are 5-edge-choosable
    Juvan, Martin ; Mohar, Bojan, 1956- ; Škrekovski, Riste
    Pokažemo, da je vsak enostavni graf, ki ima maksimalno stopnjo 4, 5-izbirljiv po povezavah.
    Source: Journal of graph theory. - ISSN 0364-9024 (Let. 32, št. 3, 1999, str. 250-264)
    Type of material - article, component part
    Publish date - 1999
    Language - english
    COBISS.SI-ID - 9190233

source: Journal of graph theory. - ISSN 0364-9024 (Let. 32, št. 3, 1999, str. 250-264)
loading ...
loading ...
loading ...