메뉴 건너뛰기
Ars Combinatoria
Volumn 56, Issue , 2000, Pages 263-269
Cycles through specified vertices in 1-tough graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0040792382     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)
References (5)
  • 1
    • 0013464789 scopus 로고
    • Cycles through specified vertices
    • Bollobás, B., Brightwell, G.: Cycles through specified vertices, Combinatorica 13, (1993), 147-155.
    • (1993) Combinatorica , vol.13 , pp. 147-155
    • Bollobás, B.1    Brightwell, G.2
  • 2
    • 0040068502 scopus 로고    scopus 로고
    • A sufficient condition for hamiltonian graphs
    • Polický, I.: A sufficient condition for hamiltonian graphs, to appear in Math. Slovaca.
    • Math. Slovaca
    • Polický, I.1
  • 3
    • 84987532020 scopus 로고
    • 2-neighborhoods and hamiltonian conditions
    • Shi, R.: 2-Neighborhoods and hamiltonian conditions, J. Graph Theory 16, (1992), 267-271.
    • (1992) J. Graph Theory , vol.16 , pp. 267-271
    • Shi, R.1
  • 4
    • 0037945007 scopus 로고    scopus 로고
    • Old hamiltonian ideas from a new point of view
    • Stacho, L.: Old hamiltonian ideas from a new point of view, Mathematische Nachrichten, 186, 1997, 251-258.
    • (1997) Mathematische Nachrichten , vol.186 , pp. 251-258
    • Stacho, L.1
  • 5
    • 0038621216 scopus 로고    scopus 로고
    • A sufficient condition guaranteeing large cycles in graphs
    • Stacho, L.: A sufficient condition guaranteeing large cycles in graphs, Discrete Mathematics, 169, 1997, 273-277.
    • (1997) Discrete Mathematics , vol.169 , pp. 273-277
    • Stacho, L.1

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