SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics

Volumn 307, Issue 7-8, 2007, Pages 832-838

Toughness and hamiltonicity in k-trees

(3) Broersma, Hajo a,b Xiong, Liming c,d Yoshimoto, Kiyoshi e

a NANKAI UNIVERSITY (China)

b DURHAM UNIVERSITY (United Kingdom)

c BEIJING INSTITUTE OF TECHNOLOGY (China)

d JIANGXI NORMAL UNIVERSITY (China)

e NIHON UNIVERSITY (Japan)

Author keywords

Chordal graph; Complexity; Hamiltonian graph; k tree; t tough graph; Toughness; Traceable graph

Indexed keywords

BOUNDARY CONDITIONS; GRAPH THEORY; HAMILTONIANS; TOUGHNESS;

CHORDAL GRAPH; HAMILTONIAN GRAPH; K-TREE; T-TOUGH GRAPH; TRACEABLE GRAPH;

TREES (MATHEMATICS);

EID: 33846485003 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/j.disc.2005.11.051 Document Type: Article

Times cited : (16)

References (16)

1
- 0040341886
- Chordal graphs and some of their derived graphs
- Balakrishnan R., and Paulraja P. Chordal graphs and some of their derived graphs. Congr. Numer. 53 (1986) 71-74
- (1986) Congr. Numer. , vol.53 , pp. 71-74
- Balakrishnan, R.¹ Paulraja, P.²

2
- 0038621285
- Not every 2-tough graph is hamiltonian
- Bauer D., Broersma H.J., and Veldman H.J. Not every 2-tough graph is hamiltonian. Discrete Appl. Math. 99 (2000) 317-321
- (2000) Discrete Appl. Math. , vol.99 , pp. 317-321
- Bauer, D.¹ Broersma, H.J.² Veldman, H.J.³

3
- 0038621278
- Chordality and 2-factors in tough graphs
- Bauer D., Katona G.Y., Kratsch D., and Veldman H.J. Chordality and 2-factors in tough graphs. Discrete Appl. Math. 99 (2000) 323-329
- (2000) Discrete Appl. Math. , vol.99 , pp. 323-329
- Bauer, D.¹ Katona, G.Y.² Kratsch, D.³ Veldman, H.J.⁴

4
- 0042284240
- More than 1-tough chordal planar graphs are hamiltonian
- Böhme T., Harant J., and Tkáč M. More than 1-tough chordal planar graphs are hamiltonian. J. Graph Theory 32 (1999) 405-410
- (1999) J. Graph Theory , vol.32 , pp. 405-410
- Böhme, T.¹ Harant, J.² Tkáč, M.³

5
- 0003720154
- SIAM, Philadelphia, PA
- Brandstädt A., Le V.B., and Spinrad J.P. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications (1999), SIAM, Philadelphia, PA
- (1999) Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications
- Brandstädt, A.¹ Le, V.B.² Spinrad, J.P.³

6
- 0004275036
- Chapman and Hall, London
- Chartrand G., and Lesniak L. Graphs and Digraphs (1996), Chapman and Hall, London
- (1996) Graphs and Digraphs
- Chartrand, G.¹ Lesniak, L.²

7
- 0039991998
- Tough enough chordal graphs are hamiltonian
- Chen G., Jacobson M.S., Kézdy A.E., and Lehel J. Tough enough chordal graphs are hamiltonian. Networks 31 (1998) 29-38
- (1998) Networks , vol.31 , pp. 29-38
- Chen, G.¹ Jacobson, M.S.² Kézdy, A.E.³ Lehel, J.⁴

8
- 36949016322
- Tough graphs and hamiltonian circuits
- Chvátal V. Tough graphs and hamiltonian circuits. Discrete Math. 5 (1973) 215-228
- (1973) Discrete Math. , vol.5 , pp. 215-228
- Chvátal, V.¹

9
- 0038282323
- 1-Tough cocomparability graphs are hamiltonian
- Deogun J.S., Kratsch D., and Steiner G. 1-Tough cocomparability graphs are hamiltonian. Discrete Math. 170 (1997) 99-106
- (1997) Discrete Math. , vol.170 , pp. 99-106
- Deogun, J.S.¹ Kratsch, D.² Steiner, G.³

10
- 84960584723
- Some theorems on abstract graphs
- Dirac G.A. Some theorems on abstract graphs. Proc. London Math. Soc. 3 2 (1952) 69-81
- (1952) Proc. London Math. Soc. , vol.3 , Issue.2 , pp. 69-81
- Dirac, G.A.¹

11
- 0004127488
- Freeman, San Francisco, CA
- Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco, CA
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

12
- 0022061394
- Finding Hamiltonian circuits in interval graphs
- Kiel J.M. Finding Hamiltonian circuits in interval graphs. Inform. Process. Lett. 20 (1985) 201-206
- (1985) Inform. Process. Lett. , vol.20 , pp. 201-206
- Kiel, J.M.¹

13
- 33846542332
- D. Kratsch, Private communication.

14
- 0038282275
- Toughness, hamiltonicity and split graphs
- Kratsch D., Lehel J., and Müller H. Toughness, hamiltonicity and split graphs. Discrete Math. 150 (1996) 231-245
- (1996) Discrete Math. , vol.150 , pp. 231-245
- Kratsch, D.¹ Lehel, J.² Müller, H.³

15
- 84986506423
- 1, 3-free graphs
- 1, 3-free graphs. J. Graph Theory 1 (1984) 139-146
- (1984) J. Graph Theory , vol.1 , pp. 139-146
- Matthews, M.M.¹ Sumner, D.P.²

16
- 0346263316
- A note on toughness and tough components
- Plummer M.D. A note on toughness and tough components. Congr. Numer. 125 (1997) 179-192
- (1997) Congr. Numer. , vol.125 , pp. 179-192
- Plummer, M.D.¹

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