메뉴 건너뛰기
Discrete Mathematics
Volumn 154, Issue 1-3, 1996, Pages 321-328
On the shortness exponent of 1-tough, maximal planar graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0043168979     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(94)00356-N     Document Type: Article
Times cited : (10)
References (10)
  • 1
    • 0011573319 scopus 로고
    • Hamiltonian circuits on 3-polytopes
    • D.W. Barnette and E. Jucovič, Hamiltonian circuits on 3-polytopes, J. Combin. Theory 9 (1970) 54-59.
    • (1970) J. Combin. Theory , vol.9 , pp. 54-59
    • Barnette, D.W.1    Jucovič, E.2
  • 2
    • 36949016322 scopus 로고
    • Tough graphs and Hamiltonian circuits
    • V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973) 215-228.
    • (1973) Discrete Math. , vol.5 , pp. 215-228
    • Chvátal, V.1
  • 3
    • 0011576051 scopus 로고
    • An upper bound on the shortness exponent of 1-tough, maximal planar graphs
    • M.B. Dillencourt, An upper bound on the shortness exponent of 1-tough, maximal planar graphs, Discrete Math. 90 (1991) 93-97.
    • (1991) Discrete Math. , vol.90 , pp. 93-97
    • Dillencourt, M.B.1
  • 5
    • 0000353323 scopus 로고
    • Shortness exponents of families of graphs
    • B. Grünbaum and H. Walther, Shortness exponents of families of graphs, J. Combin. Theory Ser. A 14 (1973) 364-385.
    • (1973) J. Combin. Theory Ser. A , vol.14 , pp. 364-385
    • Grünbaum, B.1    Walther, H.2
  • 6
    • 38249003934 scopus 로고
    • Toughness and nonhamiltonicity of polyhedral graphs
    • J. Harant, Toughness and nonhamiltonicity of polyhedral graphs, Discrete Math. 113 (1993) 249-253.
    • (1993) Discrete Math. , vol.113 , pp. 249-253
    • Harant, J.1
  • 7
    • 0043168980 scopus 로고
    • Non-hamiltonian 5/4-tough maximal planar graphs
    • J. Harant and P.J. Owens, Non-hamiltonian 5/4-tough maximal planar graphs, Discrete Math. 147 (1995) 301-305.
    • (1995) Discrete Math. , vol.147 , pp. 301-305
    • Harant, J.1    Owens, P.J.2
  • 8
    • 38249028405 scopus 로고
    • The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
    • D.A. Holton and B.D. McKay, The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combin. Theory Ser. B 45(3) (1988) 305-319.
    • (1988) J. Combin. Theory Ser. B , vol.45 , Issue.3 , pp. 305-319
    • Holton, D.A.1    McKay, B.D.2
  • 10
    • 0000019790 scopus 로고
    • A 1-tough nonhamiltonian maximal planar graph
    • T. Nishizeki, A 1-tough nonhamiltonian maximal planar graph, Discrete Math. 30 (1980) 305-307.
    • (1980) Discrete Math. , vol.30 , pp. 305-307
    • Nishizeki, T.1

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