ALL libraries (COBIB.SI union bibliographic/catalogue database)
PDF
  • A lower bound for the number of orientable triangular embeddings of some complete graphs
    Grannell, M.J. ; Knor, Martin
    We prove that, for a certain positive constant a and for an infiniteset of values of n, the number of nonisomorphic face 2-colourabletriangular embeddings of the complete graph Kn in an ... orientablesurface is at least nan2.
    Source: Journal of combinatorial theory. Series B. - ISSN 0095-8956 (Vol. 100, iss. 2, 2010, str. 216-225)
    Type of material - article, component part
    Publish date - 2010
    Language - english
    COBISS.SI-ID - 2048242195
    DOI

Shelf entry