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

메뉴 건너뛰기

Discrete Mathematics

Volumn 202, Issue 1-3, 1999, Pages 33-44

Hamiltonian powers in threshold and arborescent comparability graphs

(2) Donnelly, Sam a Isaak, Garth b

a UNIVERSITY OF GEORGIA (United States)

b LEHIGH UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

Times cited : (16)

References (16)

1
- 0041978476
- Toughness and triangle free graphs
- D. Bauer, J. Van den Heuval, E. Schmeichel, Toughness and triangle free graphs, J. Combin. Theory B 65 (1995) 208-221.
- (1995) J. Combin. Theory B , vol.65 , pp. 208-221
- Bauer, D.¹ Van Den Heuval, J.² 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
- 77957101001
- Aggregation of inequalities in integer programming
- V. Chvátal, P.L. Hammer, Aggregation of inequalities in integer programming, Ann. Discrete Math, 1 (1977) 145-162.
- (1977) Ann. Discrete Math , vol.1 , pp. 145-162
- Chvátal, V.¹ Hammer, P.L.²

4
- 0019590904
- Complement reducible graphs
- D. Corneil, H. Lerchs, L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163-174.
- (1981) Discrete Appl. Math. , vol.3 , pp. 163-174
- Corneil, D.¹ Lerchs, H.² Stewart Burlingham, L.³

5
- 0041406549
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- P. Damaschke, J.S. Deogun, D. Kratsch, G. Steiner, Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm, Order 8 (1992) 383-391.
- (1992) Order , vol.8 , pp. 383-391
- Damaschke, P.¹ Deogun, J.S.² Kratsch, D.³ Steiner, G.⁴

6
- 0038282323
- 1-Tough cocomparability graphs are Hamiltonian
- J.S. Deogun, D. Kratsch, G. Steiner, 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.³

7
- 0028452825
- Polynomial algorithms for Hamiltonian cycle in cocomparability graphs
- J.S. Deogun, G. Steiner, Polynomial algorithms for Hamiltonian cycle in cocomparability graphs, SIAM J. Comput. 23 (1994) 520-552.
- (1994) SIAM J. Comput. , vol.23 , pp. 520-552
- Deogun, J.S.¹ Steiner, G.²

8
- 0041477345
- Honors Thesis, Dept. of Math., Lehigh University, Bethlehem
- S. Donnelly, Powers of Hamiltonian paths and powers of Hamiltonian cycles in threshold graphs, Honors Thesis, Dept. of Math., Lehigh University, Bethlehem, 1997.
- (1997) Powers of Hamiltonian Paths and Powers of Hamiltonian Cycles in Threshold Graphs
- Donnelly, S.¹

9
- 0041978477
- Scheduling dyadic intervals
- J.R. Driscoll, D.M. Healy, G. Isaak, Scheduling dyadic intervals, Discrete Appl. Math. 63 1995 101-116.
- (1995) Discrete Appl. Math. , vol.63 , pp. 101-116
- Driscoll, J.R.¹ Healy, D.M.² Isaak, G.³

10
- 0013525225
- Classical perfect graphs
- P. Duchet, Classical perfect graphs, Ann. Discrete Math. 21 (1984) 67-96.
- (1984) Ann. Discrete Math. , vol.21 , pp. 67-96
- Duchet, P.¹

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

12
- 0032362336
- Powers of Hamiltonian paths in interval graphs
- G. Isaak, Powers of Hamiltonian paths in interval graphs, J. Graph Theory 27 (1998) 31-38.
- (1998) J. Graph Theory , vol.27 , pp. 31-38
- Isaak, G.¹

13
- 0038282275
- Toughness, Hamiltonicity and split graphs
- D. Kratsch, J. Lehel, H. Muller, Toughness, Hamiltonicity and split graphs, Discrete Math. 150 (1996) 231-245.
- (1996) Discrete Math. , vol.150 , pp. 231-245
- Kratsch, D.¹ Lehel, J.² Muller, H.³

14
- 0042479122
- Longest cycles in threshold graphs
- N.V.R. Mahadev, U.N. Peled, Longest cycles in threshold graphs, Discrete Math. 135 (1994) 169-176.
- (1994) Discrete Math. , vol.135 , pp. 169-176
- Mahadev, N.V.R.¹ Peled, U.N.²

15
- 85014217654
- Threshold graphs and related topics
- N.V.R Mahadev, U.N. Peled, Threshold graphs and related topics, Ann. Discrete Math. 56 (1995).
- (1995) Ann. Discrete Math. , vol.56
- Mahadev, N.V.R.¹ Peled, U.N.²

16
- 0003736078
- Prentice-Hall, Englewood cliffs, NJ
- D.B. West, Introduction to Graph Theory, Prentice-Hall, Englewood cliffs, NJ, (1996).
- (1996) Introduction to Graph Theory
- West, D.B.¹

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