메뉴 건너뛰기
Discrete Mathematics
Volumn 170, Issue 1-3, 1997, Pages 195-201
Longest cycles in 3-connected graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0042129912     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00008-8     Document Type: Article
Times cited : (10)
References (5)
  • 1
    • 84987588004 scopus 로고
    • An improvement of Fraisse's sufficient condition for Hamiltonian graphs
    • A. Ainouche, An improvement of Fraisse's sufficient condition for Hamiltonian graphs, J. Graph Theory 16 (1992) 529-543.
    • (1992) J. Graph Theory , vol.16 , pp. 529-543
    • Ainouche, A.1
  • 3
    • 0013528490 scopus 로고
    • Hamiltonism, degree sum and neighborhood intersections
    • E. Flandrin, H.A. Jung and H. Li, Hamiltonism, Degree sum and neighborhood intersections, Discrete Math. 90 (1991) 41-52.
    • (1991) Discrete Math. , vol.90 , pp. 41-52
    • Flandrin, E.1    Jung, H.A.2    Li, H.3
  • 4
    • 0039388178 scopus 로고
    • Longest cycles and independent sets in k-connected graphs
    • V.R. Kulli, ed., Vischwa Internat. Publ. Gulbarga, India
    • P. Fraisse and H.A. Jung, Longest cycles and independent sets in k-connected graphs, in: V.R. Kulli, ed., Recent Studies in Graph Theory (Vischwa Internat. Publ. Gulbarga, India, 1989) 114-139.
    • (1989) Recent Studies in Graph Theory , pp. 114-139
    • Fraisse, P.1    Jung, H.A.2
  • 5
    • 38249003046 scopus 로고
    • Hamiltonian paths and hamiltonian connectivity in graphs
    • B. Wei, Hamiltonian paths and hamiltonian connectivity in graphs, Discrete Math. 121 (1993) 223-228.
    • (1993) Discrete Math. , vol.121 , pp. 223-228
    • Wei, B.1

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