SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 21, Issue 4, 1996, Pages 405-412

2-Factors in triangle-free graphs

(3) Bauer, D a Van Den Heuvel, J b,d Schmeichel, E c

a Stevens Institute of Technology (United States)

b SIMON FRASER UNIVERSITY (Canada)

c SAN JOSE STATE UNIVERSITY (United States)

d LONDON SCHOOL OF ECONOMICS (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030527612 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0118(199604)21:4<405::AID-JGT6>3.0.CO;2-T Document Type: Article

Times cited : (4)

References (14)

1
- 0348073150
- Tough Ramsey graphs without short cycles
- N. Alon, Tough Ramsey graphs without short cycles. J. Algebraic Comb. 4 (1995) 189-195.
- (1995) J. Algebraic Comb. , vol.4 , pp. 189-195
- Alon, N.¹

2
- 84987505868
- Toughness, minimum degree and the existence of 2-factors
- D. Bauer and E. Schmeichel, Toughness, minimum degree and the existence of 2-factors. J. Graph Theory 18 (1994) 241-256.
- (1994) J. Graph Theory , vol.18 , pp. 241-256
- Bauer, D.¹ Schmeichel, E.²

3
- 0038282367
- Some recent results on long cycles in tough graphs
- John Wiley & Sons, New York
- D. Bauer, E. Schmeichel, and H. J. Veldman, Some recent results on long cycles in tough graphs. Graph Theory, Combinatorics, and Applications. John Wiley & Sons, New York (1991) pp. 113-121.
- (1991) Graph Theory, Combinatorics, and Applications , pp. 113-121
- Bauer, D.¹ Schmeichel, E.² Veldman, H.J.³

4
- 0347886397
- Cycles in tough graphs - Updating the last four years
- John Wiley and Sons, New York
- D. Bauer, E. Schmeichel, and H. J. Veldman, Cycles in tough graphs - Updating the last four years. Graph Theory, Combinatorics, and Applications, John Wiley and Sons, New York (1995) pp. 19-34.
- (1995) Graph Theory, Combinatorics, and Applications , pp. 19-34
- Bauer, D.¹ Schmeichel, E.² Veldman, H.J.³

5
- 0041978476
- Toughness and triangle-free graphs
- D. Bauer, J. van den Heuvel, and E. Schmeichel. Toughness and triangle-free graphs. J. Combinat. Theory Ser. B 65 (1995), 208-221.
- (1995) J. Combinat. Theory Ser. B , vol.65 , pp. 208-221
- Bauer, D.¹ Van Den Heuvel, J.² Schmeichel, E.³

6
- 1542509184
- Preprint
- S. Brandt, Cycles and paths in triangle-free graphs. Preprint (1993).
- (1993) Cycles and Paths in Triangle-free Graphs
- Brandt, S.¹

7
- 0004275036
- Wadsworth, Belmont, CA
- G. Chartrand and L. Lesniak. Graphs and Digraphs. Wadsworth, Belmont, CA (1986).
- (1986) Graphs and Digraphs
- Chartrand, G.¹ Lesniak, L.²

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

9
- 84986435992
- Toughness and the existence of k-factors
- H. Enomoto, B. Jackson, P. Katerinis, 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.² Katerinis, P.³ Saito, A.⁴

10
- 0001869610
- Graph theory and probability
- P. Erdös, Graph theory and probability. Can. J. Math. 11 (1959) 34-38.
- (1959) Can. J. Math. , vol.11 , pp. 34-38
- Erdös, P.¹

11
- 0346121139
- On the construction of certain graphs
- P. Erdös, On the construction of certain graphs. J. Combinat. Theory 1 (1966) 149-153.
- (1966) J. Combinat. Theory , vol.1 , pp. 149-153
- Erdös, P.¹

12
- 51249170131
- On hamiltonian bipartite graphs
- J. Moon and L. Moser, On hamiltonian bipartite graphs. Is. J. Math. 1 (1963) 163-165.
- (1963) Is. J. Math. , vol.1 , pp. 163-165
- Moon, J.¹ Moser, L.²

13
- 0001263144
- An extremal problem in graph theory
- in Hungarian
- P. Turán, An extremal problem in graph theory. Mat. Fiz. Lapok 48 (1941) 436-452 (in Hungarian).
- (1941) Mat. Fiz. Lapok , vol.48 , pp. 436-452
- Turán, P.¹

14
- 0000191143
- The factors of graphs
- W. T. Tutte, The factors of graphs. Can. J. Math. 4 (1952) 314-328.
- (1952) Can. J. Math. , vol.4 , pp. 314-328
- Tutte, W.T.¹

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