메뉴 건너뛰기




Volumn 70, Issue 2, 1997, Pages 217-224

On a closure concept in claw-free graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000964940     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.1732     Document Type: Article
Times cited : (272)

References (10)
  • 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
  • 7
    • 0013511371 scopus 로고
    • Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
    • D. J. Oberly and D. P. Sumner, Every connected, locally connected nontrivial graph with no induced claw is hamiltonian, J. Graph Theory 3 (1979), 351-356.
    • (1979) J. Graph Theory , vol.3 , pp. 351-356
    • Oberly, D.J.1    Sumner, D.P.2
  • 9
    • 84986450045 scopus 로고
    • Reflections on graph theory
    • C. Thomassen, Reflections on graph theory, J. Graph Theory 10 (1986), 309-324.
    • (1986) J. Graph Theory , vol.10 , pp. 309-324
    • Thomassen, C.1
  • 10
    • 0000578685 scopus 로고
    • On hamiltonian line graphs and connectivity
    • S. Zhan, On hamiltonian line graphs and connectivity, Discrete Math. 89 (1991), 89-95.
    • (1991) Discrete Math. , vol.89 , pp. 89-95
    • Zhan, S.1


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