SCOPUS 정보 검색 플랫폼

Volumn 167-168, Issue , 1997, Pages 329-339

Maximum and minimum toughness of graphs of small genus

b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039382445 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(96)00238-5 Document Type: Article

Times cited : (8)

References (15)

1
- 0002508290
- Vulnerability in graphs - A comparative survey
- C.A. Barefoot, R. Entringer and H.C. Swart, Vulnerability in graphs - a comparative survey, J. Combin. Math. Combin. Comput. 1 (1987) 13-22.
- (1987) J. Combin. Math. Combin. Comput. , vol.1 , pp. 13-22
- Barefoot, C.A.¹ Entringer, R.² Swart, H.C.³

2
- 38249016410
- Recognizing tough graphs is NP-hard
- D. Bauer, S.L. Hakimi and E. Schmeichel, Recognizing tough graphs is NP-hard, Discrete Appl. Math. 28 (1990) 191-195.
- (1990) Discrete Appl. Math. , vol.28 , pp. 191-195
- Bauer, D.¹ Hakimi, S.L.² Schmeichel, E.³

3
- 0004275036
- Wadsworth & Brooks/Cole, Monterey
- G. Chartrand and L. Lesniak, Graphs and Digraphs (Wadsworth & Brooks/Cole, Monterey, 1986).
- (1986) Graphs and Digraphs
- Chartrand, G.¹ Lesniak, L.²

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
- 0000134659
- Toughness and delaunay triangulations
- M.B. Dillencourt, Toughness and Delaunay triangulations, Discrete Comput. Geom. 5 (1990) 575-601.
- (1990) Discrete Comput. Geom. , vol.5 , pp. 575-601
- Dillencourt, M.B.¹

6
- 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.¹

7
- 0004736285
- On the toughness of a graph
- W. Goddard and H.C. Swart, On the toughness of a graph, Quaestiones Math. 13 (1990) 217-232.
- (1990) Quaestiones Math. , vol.13 , pp. 217-232
- Goddard, W.¹ Swart, H.C.²

8
- 0004291883
- Wiley, New York
- B. Grünbaum, Convex Polytopes (Wiley, New York, 1967) 217.
- (1967) Convex Polytopes , pp. 217
- Grünbaum, B.¹

9
- 38249003934
- Toughness and nonhamiltonicity of polyhedral graphs
- J. Harant, Toughness and nonhamiltonicity of polyhedral graphs, Discrete Math. 113 (1993) 249-253.
- (1993) Discrete Math. , vol.113 , pp. 249-253
- Harant, J.¹

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

11
- 0001008278
- Uniqueness and faithfulness of embedding of toroidal graphs
- S. Negami, Uniqueness and faithfulness of embedding of toroidal graphs, Discrete Math. 44 (1983) 161-180.
- (1983) Discrete Math. , vol.44 , pp. 161-180
- Negami, S.¹

13
- 84951603788
- Das geschlect des vollständiger paaren graphen
- G. Ringel, Das Geschlect des vollständiger paaren Graphen, Abh. Math. Sem. Univ. Hamburg 28 (1965) 139-150.
- (1965) Abh. Math. Sem. Univ. Hamburg , vol.28 , pp. 139-150
- Ringel, G.¹

15
- 0011639350
- Connectivity, genus and the number of components in vertex-deleted subgraphs
- E.F. Schmeichel and G.S. Bloom, Connectivity, genus and the number of components in vertex-deleted subgraphs, J. Combin. Theory Ser. B 27 (1979) 198-201.
- (1979) J. Combin. Theory Ser. B , vol.27 , pp. 198-201
- Schmeichel, E.F.¹ Bloom, G.S.²

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