SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 32, Issue 4, 1999, Pages 405-410

More than one tough chordal planar graphs are Hamiltonian

(3) Böhme, Thomas a Harant, Jochen a Tkáč, Michal b

a ILMENAU UNIVERSITY OF TECHNOLOGY (Germany)

b TECHNICAL UNIVERSITY OF KO ICE (Slovakia)

Author keywords

Chordal planar graphs; Hamiltonian cycles; Toughness

Indexed keywords

EID: 0042284240 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z Document Type: Article

Times cited : (25)

References (13)

1
- 0004487058
- preprint, Memorandum No. 1400, Universiteit Twente, July
- D. Bauer, H. J. Broersma, and H. J. Veldman, Not every 2-tough graph is Hamiltonian, preprint, Memorandum No. 1400, Universiteit Twente, July 1997.
- (1997) Not Every 2-tough Graph Is Hamiltonian
- Bauer, D.¹ Broersma, H.J.² Veldman, H.J.³

2
- 0037833863
- Hamiltonian graphs
- L. Beinecke and R. J. Wilson, eds., Academic, London and New York
- J. C. Bermond, "Hamiltonian graphs," L. Beinecke and R. J. Wilson, eds., Selected topics in graph theory, Academic, London and New York, 1978, pp. 127-167.
- (1978) Selected Topics in Graph Theory , pp. 127-167
- Bermond, J.C.¹

3
- 85034120671
- preprint
- G. Chen, M. S. Jacobson, A. Kézdy, and J. Lehel, Tough enough chordal graphs are Hamiltonian, preprint.
- Tough Enough Chordal Graphs Are Hamiltonian
- Chen, G.¹ Jacobson, M.S.² Kézdy, A.³ Lehel, J.⁴

4
- 36949016322
- 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.¹

5
- 0011576051
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- M. B. Dillencourt, An upper bound on the shortness exponent of 1-tough, maximal planar graphs, Discrete Math 90 (1991), 93-97.
- (1991) Discrete Math , vol.90 , pp. 93-97
- Dillencourt, M.B.¹

6
- 84951600612
- On rigid circuit graphs
- G. A. Dirac, On rigid circuit graphs, Abh Math Sem Univ Hamburg 25 (1961), 71-76.
- (1961) Abh Math Sem Univ Hamburg , vol.25 , pp. 71-76
- Dirac, G.A.¹

7
- 84986435992
- Toughness and the existence of k-factors
- H. Enomoto, B. Jackson, P. Katarinis, and A. Saito, Toughness and the existence of k-factors, J Graph Theory 9 (1985), 87-95.
- (1985) J Graph Theory , vol.9 , pp. 87-95
- Enomoto, H.¹ Jackson, B.² Katarinis, P.³ Saito, A.⁴

8
- 0000353323
- Shortness exponents of families of graphs
- B. Grünbaum and H. Walther, Shortness exponents of families of graphs, J Combin Theory 14 (1973), 364-385.
- (1973) J Combin Theory , vol.14 , pp. 364-385
- Grünbaum, B.¹ Walther, H.²

9
- 0043168980
- Non-hamiltonian 5/4-tough maximal planar graphs
- J. Harant and P. J. Owens, Non-hamiltonian 5/4-tough maximal planar graphs, Discrete Math 147 (1995), 301-305.
- (1995) Discrete Math , vol.147 , pp. 301-305
- Harant, J.¹ Owens, P.J.²

10
- 85034126652
- preprint, Univ Surrey
- P. Owens, Non-Hamiltonian maximal planar graphs with high toughness, preprint, Univ Surrey, 1988.
- (1988) Non-Hamiltonian Maximal Planar Graphs with High Toughness
- Owens, P.¹

11
- 0000019790
- A 1-tough nonhamiltonian maximal planar graph
- T. Nishizeki, A 1-tough nonhamiltonian maximal planar graph, Discrete Math 30 (1980), 305-307.
- (1980) Discrete Math , vol.30 , pp. 305-307
- Nishizeki, T.¹

12
- 0043168979
- On the shortness exponent of 1-tough, maximal planar graphs
- M. Tkáč, On the shortness exponent of 1-tough, maximal planar graphs, Discrete Math 154 (1996), 321-328.
- (1996) Discrete Math , vol.154 , pp. 321-328
- Tkáč, M.¹

13
- 71049134816
- A theorem on planar graphs
- W. T. Tutte, A theorem on planar graphs, Trans Amer Math Soc 82 (1956), 99-116.
- (1956) Trans Amer Math Soc , vol.82 , pp. 99-116
- Tutte, W.T.¹

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