메뉴 건너뛰기




Volumn 87, Issue 1, 2003, Pages 2-16

Blocking nonorientability of a surface

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0037288897     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(02)00025-4     Document Type: Review
Times cited : (7)

References (10)
  • 4
    • 38249008557 scopus 로고
    • Generating locally cyclic triangulations of surfaces
    • A. Malnič, B. Mohar, Generating locally cyclic triangulations of surfaces, J. Combin. Theory Ser. B 56 (1992) 147-164.
    • (1992) J. Combin. Theory Ser. B , vol.56 , pp. 147-164
    • Malnič, A.1    Mohar, B.2
  • 5
    • 0001572003 scopus 로고
    • Combinatorial local planarity and the width of graph embeddings
    • B. Mohar, Combinatorial local planarity and the width of graph embeddings, Canad. J. Math. 44 (1992) 1272-1288.
    • (1992) Canad. J. Math. , vol.44 , pp. 1272-1288
    • Mohar, B.1
  • 6
    • 21844506893 scopus 로고
    • Uniqueness and minimality of large face-width embeddings of graphs
    • B. Mohar, Uniqueness and minimality of large face-width embeddings of graphs, Combinatorica 15 (1995) 541-556.
    • (1995) Combinatorica , vol.15 , pp. 541-556
    • Mohar, B.1
  • 7
    • 0013536054 scopus 로고    scopus 로고
    • On the orientable genus of graphs with bounded nonorientable genus
    • B. Mohar, On the orientable genus of graphs with bounded nonorientable genus, Discrete Math. 182 (1998) 245-253.
    • (1998) Discrete Math. , vol.182 , pp. 245-253
    • Mohar, B.1
  • 8
    • 0013465114 scopus 로고    scopus 로고
    • Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD
    • B. Mohar, C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
    • (2001)
    • Mohar, B.1    Thomassen, C.2
  • 9
    • 84987588667 scopus 로고
    • On the orientable genus of graphs embedded in the Klein bottle
    • N. Robertson, R. Thomas, On the orientable genus of graphs embedded in the Klein bottle, J. Graph Theory 15 (1991) 407-419.
    • (1991) J. Graph Theory , vol.15 , pp. 407-419
    • Robertson, N.1    Thomas, R.2
  • 10
    • 38249026284 scopus 로고
    • The graph genus problem is NP-complete
    • C. Thomassen, The graph genus problem is NP-complete, J. Algorithms 10 (1989) 568-576.
    • (1989) J. Algorithms , vol.10 , pp. 568-576
    • Thomassen, C.1


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