메뉴 건너뛰기




Volumn 203, Issue 1-3, 1999, Pages 253-260

Panconnectivity of locally connected claw-free graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0347145862     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00010-2     Document Type: Article
Times cited : (11)

References (8)
  • 1
    • 0030511209 scopus 로고    scopus 로고
    • Every 3-connected, locally connected, claw-free graph is Hamilton-connected
    • A.S. Asratian, Every 3-connected, locally connected, claw-free graph is Hamilton-connected, J. Graph Theory 23 (1996) 191-201.
    • (1996) J. Graph Theory , vol.23 , pp. 191-201
    • Asratian, A.S.1
  • 3
    • 84986487066 scopus 로고
    • 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
    • H.J. Broersma, H.J. Veldman, 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian, J. Graph Theory 11 (1987) 399-407.
    • (1987) J. Graph Theory , vol.11 , pp. 399-407
    • Broersma, H.J.1    Veldman, H.J.2
  • 4
    • 51249181145 scopus 로고
    • A note on locally connected and hamiltonian-connected graphs
    • G. Chartrand, R.T. Gould, A.D. Polimeni, A note on locally connected and hamiltonian-connected graphs, Israel J. Math. 33 (1979) 5-8.
    • (1979) Israel J. Math. , vol.33 , pp. 5-8
    • Chartrand, G.1    Gould, R.T.2    Polimeni, A.D.3
  • 5
    • 0013481917 scopus 로고
    • Hamiltonian properties of connected, locally connected graphs
    • L. Clark, Hamiltonian properties of connected, locally connected graphs, Congr. Numer. 32 (1981) 199-204.
    • (1981) Congr. Numer. , vol.32 , pp. 199-204
    • Clark, L.1
  • 7
    • 0013511371 scopus 로고
    • Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
    • D.J. Oberly, 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
  • 8
    • 38249024239 scopus 로고
    • 1,3-free graphs
    • 1,3-free graphs, Discrete Math. 78 (1989) 307-313.
    • (1989) Discrete Math. , vol.78 , pp. 307-313
    • Zhang, C.Q.1


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