SCOPUS 정보 검색 플랫폼

Volumn 190, Issue 1-3, 1998, Pages 295-297

The toughness of split graphs

Author keywords

Graph algorithm; Hamiltonian cycle; Split graph; Toughness

Indexed keywords

EID: 0042045567 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(98)00156-3 Document Type: Article

Times cited : (23)

References (7)

1
- 38249016410
- Recognizing tough graphs is NP-hard
- D. Bauer, S.L. Hakimi, 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.³

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

3
- 51249177040
- On submodular function minimization
- W.H. Cunningham, On submodular function minimization, Combinatorica 5 (1985) 185-192.
- (1985) Combinatorica , vol.5 , pp. 185-192
- Cunningham, W.H.¹

4
- 0043028361
- University of Waterloo, CORR 76-3, March
- S. Foldes, P.L. Hammer, Split graphs, University of Waterloo, CORR 76-3, March 1976.
- (1976) Split Graphs
- Foldes, S.¹ Hammer, P.L.²

5
- 0003947606
- Academic Press, New York
- M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic, M.C.¹

6
- 0003957164
- Springer, Berlin
- M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
- (1988) Geometric Algorithms and Combinatorial Optimization
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

7
- 0038282275
- Toughness, hamiltonicity and split graphs
- D. Kratsch, J. Lehel, H. Müller, 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.³

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