메뉴 건너뛰기




Volumn 22, Issue 2, 1996, Pages 181-187

Sufficient Conditions for a Digraph to be Hamiltonian

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0030544866     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199606)22:2<181::AID-JGT9>3.0.CO;2-J     Document Type: Article
Times cited : (37)

References (16)
  • 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
  • 2
    • 84986533214 scopus 로고
    • Locally semicomplete digraphs: A generalization of tournaments
    • J. Bang-Jensen, Locally semicomplete digraphs: a generalization of tournaments. J. Graph Theory 14 (1990) 371-390.
    • (1990) J. Graph Theory , vol.14 , pp. 371-390
    • Bang-Jensen, J.1
  • 4
    • 85033735098 scopus 로고    scopus 로고
    • A sufficient condition for a semicomplete multipartitie digraph to be Hamiltonian
    • to appear
    • J. Bang-Jensen, G. Gutin, and J. Huang, A sufficient condition for a semicomplete multipartitie digraph to be Hamiltonian. Discrete Math., to appear.
    • Discrete Math.
    • Bang-Jensen, J.1    Gutin, G.2    Huang, J.3
  • 7
    • 84987588119 scopus 로고
    • Quasi-transitive digraphs
    • J. Bang-Jensen and J. Huang, Quasi-transitive digraphs. J. Graph Theory, 20 (1995) 141-161.
    • (1995) J. Graph Theory , vol.20 , pp. 141-161
    • Bang-Jensen, J.1    Huang, J.2
  • 8
    • 0001775236 scopus 로고
    • Basic graph theory: Paths and circuits
    • North-Holland, Amsterdam
    • J. A. Bondy, Basic graph theory: Paths and circuits. Handbook in Combinatorics, North-Holland, Amsterdam (1995).
    • (1995) Handbook in Combinatorics
    • Bondy, J.A.1
  • 10
    • 0041092982 scopus 로고
    • A short proof of Meyniel's theorem
    • J. A. Bondy and C. Thomassen, A short proof of Meyniel's theorem. Discrete Math. 19 (1977) 195-197.
    • (1977) Discrete Math. , vol.19 , pp. 195-197
    • Bondy, J.A.1    Thomassen, C.2
  • 11
    • 0001692155 scopus 로고
    • New sufficient conditions for cycles in graphs
    • G. Fan, New sufficient conditions for cycles in graphs. J. Combinat. Theory. Ser. B 37 (1984) 221-227.
    • (1984) J. Combinat. Theory. Ser. B , vol.37 , pp. 221-227
    • Fan, G.1
  • 12
    • 0040012100 scopus 로고
    • Une condition suffisante d'existence d'un circuit hamiltonien
    • A. Ghouila-Houri, Une condition suffisante d'existence d'un circuit hamiltonien. CR Acad. Sci. Paris 25 (1960) 495-497.
    • (1960) CR Acad. Sci. Paris , vol.25 , pp. 495-497
    • Ghouila-Houri, A.1
  • 13
    • 85033764025 scopus 로고
    • Ph.D thesis, RWTH Aachen
    • Y. Guo, Ph.D thesis, RWTH Aachen (1995).
    • (1995)
    • Guo, Y.1
  • 14
    • 84987588875 scopus 로고
    • Directed Hamiltonian graphs
    • Y. Manoussakis, Directed Hamiltonian graphs. J. Graph Theory 16 (1992) 51-59.
    • (1992) J. Graph Theory , vol.16 , pp. 51-59
    • Manoussakis, Y.1
  • 15
    • 0039419801 scopus 로고
    • Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe orienté
    • H. Meyniel, Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe orienté. J. Combinat. Theory. Ser. B 14 (1973) 137-147.
    • (1973) J. Combinat. Theory. Ser. B , vol.14 , pp. 137-147
    • Meyniel, H.1
  • 16
    • 84962984525 scopus 로고
    • Sufficient conditions for cycles in digraphs
    • D. R. Woodall, Sufficient conditions for cycles in digraphs. Proc. London Math. Soc. 24 (1972) 739-755.
    • (1972) Proc. London Math. Soc. , vol.24 , pp. 739-755
    • Woodall, D.R.1


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