메뉴 건너뛰기




Volumn 64, Issue , 2002, Pages 33-49

Embedding Graphs Containing K5-Subdivisions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0142169020     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (18)

References (13)
  • 4
    • 0142162881 scopus 로고    scopus 로고
    • Embeddings of small graphs on the torus
    • to appear
    • A. Gagarin, W. Kocay, and D. Neilson, "Embeddings of small graphs on the torus", Cubo 5 (2003), no. 2, to appear.
    • (2003) Cubo , vol.5 , Issue.2
    • Gagarin, A.1    Kocay, W.2    Neilson, D.3
  • 7
    • 57949110607 scopus 로고
    • Embedding graphs in the torus in linear time
    • Integer programming and combinatorial optimization (Copenhagen), Springer, Berlin
    • M. Juvan, J. Marinček, and B. Mohar, "Embedding graphs in the torus in linear time", Integer programming and combinatorial optimization (Copenhagen, 1995), Lecture Notes in Comput. Sci., 920, Springer, Berlin, 360-363.
    • (1995) Lecture Notes in Comput. Sci. , vol.920 , pp. 360-363
    • Juvan, M.1    Marinček, J.2    Mohar, B.3
  • 9
    • 0000157130 scopus 로고
    • Sur le problème des courbes gauches en topologie
    • K. Kuratowski, "Sur le problème des courbes gauches en topologie", Fund. Math. 15 (1930), 271-283.
    • (1930) Fund. Math. , vol.15 , pp. 271-283
    • Kuratowski, K.1
  • 10
    • 38249001131 scopus 로고
    • Projective planarity in linear time
    • B. Mohar, "Projective planarity in linear time", Journal of Algorithms 15 (1993), 482-502.
    • (1993) Journal of Algorithms , vol.15 , pp. 482-502
    • Mohar, B.1
  • 11
    • 0041372793 scopus 로고    scopus 로고
    • A linear time algorithm for embedding graphs in an arbitrary surface
    • electronic
    • B. Mohar, "A linear time algorithm for embedding graphs in an arbitrary surface", SIAM J. Discrete Math. 12 (1999), no. 1, 6-26 (electronic).
    • (1999) SIAM J. Discrete Math. , vol.12 , Issue.1 , pp. 6-26
    • Mohar, B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.