메뉴 건너뛰기




Volumn 178, Issue 1-3, 1998, Pages 251-255

On intersection representations of co-planar graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042357586     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)81834-1     Document Type: Article
Times cited : (17)

References (16)
  • 1
    • 84966228398 scopus 로고
    • Every planar map is four-colorable
    • K. Appel and W. Haken, Every planar map is four-colorable, Bull. Amer. Math. Soc. 82 (1976) 711-712.
    • (1976) Bull. Amer. Math. Soc. , vol.82 , pp. 711-712
    • Appel, K.1    Haken, W.2
  • 4
    • 0001437623 scopus 로고
    • Kontaktprobleme den konformen abbildung, berichte über die verhandlungen der sächsischen akademie der wissenschaften, Leipzig
    • P. Koebe, Kontaktprobleme den konformen Abbildung, Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften, Leipzig, Math.-Physische Klasse 88 (1936) 141-164.
    • (1936) Math.-Physische Klasse , vol.88 , pp. 141-164
    • Koebe, P.1
  • 5
    • 4243680318 scopus 로고
    • Academia - Publishing House of the Czechoslovak Academy of Sciences, Prague
    • J. Kratochvíl, M. Goljan and P. Kučera, String Graphs (Academia - Publishing House of the Czechoslovak Academy of Sciences, Prague, 1986).
    • (1986) String Graphs
    • Kratochvíl, J.1    Goljan, M.2    Kučera, P.3
  • 6
    • 0002838419 scopus 로고
    • String graphs II. Recognizing string graphs is NP-hard
    • J. Kratochvíl, String graphs II. Recognizing string graphs is NP-hard, J. Combin. Theory Ser. B 52 (1991) 67-78.
    • (1991) J. Combin. Theory Ser. B , vol.52 , pp. 67-78
    • Kratochvíl, J.1
  • 7
    • 0001821283 scopus 로고
    • String graphs requiring exponential representations
    • J. Kratochvíl and J. Matoušek, String graphs requiring exponential representations, J. Combin. Theory Ser. B 53 (1991) 1-4.
    • (1991) J. Combin. Theory Ser. B , vol.53 , pp. 1-4
    • Kratochvíl, J.1    Matoušek, J.2
  • 9
    • 0006113213 scopus 로고
    • INDEPENDENT SET and CLIQUE problems in intersection denned classes of graphs
    • J. Kratochvíl and J. Nešetřil, INDEPENDENT SET and CLIQUE problems in intersection denned classes of graphs, Comment. Math. Univ. Carolin. 31 (1990) 85-93.
    • (1990) Comment. Math. Univ. Carolin. , vol.31 , pp. 85-93
    • Kratochvíl, J.1    Nešetřil, J.2
  • 11
    • 38249000671 scopus 로고
    • A polynomial circle packing algorithm
    • B. Mohar, A polynomial circle packing algorithm, Discrete Math. 117 (1993) 257-263
    • (1993) Discrete Math. , vol.117 , pp. 257-263
    • Mohar, B.1
  • 13
    • 0000326269 scopus 로고
    • Topology of thin film RC-circuits
    • F.W. Sinden, Topology of thin film RC-circuits, Bell System Tech. J. (1966) 1639-1662.
    • (1966) Bell System Tech. J. , pp. 1639-1662
    • Sinden, F.W.1
  • 15
    • 38249043030 scopus 로고
    • Interval representations of planar graphs
    • C. Thomassen, Interval representations of planar graphs, J. Combin. Theory Ser. B 40 (1986) 9-20.
    • (1986) J. Combin. Theory Ser. B , vol.40 , pp. 9-20
    • Thomassen, C.1
  • 16
    • 0008762825 scopus 로고
    • Ph.D. thesis, Göttingen
    • n, Ph.D. thesis, Göttingen, 1967.
    • (1967) n
    • Wegner, G.1


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