- Regular embeddings of complete bipartite graphs
Number of the records: 1  

Regular embeddings of complete bipartite graphs

  1. SYS0194685
    LBL
      
    -----naa--22--------450-
    005
      
    20240627101723.1
    014
      
    $a 000180486500028 $2 WOS CC. SCIE
    014
      
    $a 2-s2.0-0037032977 $2 SCOPUS
    017
    70
    $a 10.1016/S0012-365X(02)00539-3 $2 DOI
    100
      
    $a 20140218d2002 m y-slo-03 ----ba
    101
    0-
    $a eng
    102
      
    $a NL
    200
    1-
    $a Regular embeddings of complete bipartite graphs $f R. Nedela, M. Skoviera, A. Zlatos
    330
      
    $a We prove that for any prime number p the complete bipartite graph K-p,K-p has, up to isomorphism, precisely one regular embedding on an orientable surface-the well-known embedding with faces bounded by hamiltonian cycles.
    463
    -1
    $1 001 umb_un_cat*0329647 $1 011 $a 0012-365X $1 011 $a 1872-681X $1 200 1 $a Discrete Mathematics $v Vol. 258, no. 1-3 (2002), pp. 379-381 $1 210 $a Amsterdam $c Elsevier B.V. $d 2002
    606
    0-
    $3 umb_un_auth*0036218 $a matematika $X mathematics
    606
    0-
    $3 umb_un_auth*0125065 $a regulárne mapy
    606
    0-
    $3 umb_un_auth*0039537 $a grafy $X charts $X graphs
    606
    0-
    $3 umb_un_auth*0116334 $a regular maps
    615
      
    $n 51 $a Matematika $2 konspekt
    675
      
    $a 51 $v 3. $z slo
    700
    -0
    $3 umb_un_auth*0001645 $a Nedela $b Roman $p UMBFP12 $4 070 $9 34 $f 1960- $T Inštitút matematiky a informatiky
    701
    -0
    $3 umb_un_auth*0022262 $a Škoviera $b Martin $4 070 $9 33
    701
    -1
    $3 umb_un_auth*0228443 $a Zlatos $b Andrej $4 070 $9 33
    801
    -0
    $a SK $b BB301 $g AACR2 $9 unimarc sk
    T85
      
    $x existuji fulltexy
Number of the records: 1  

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