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

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 87, Issue 2, 2003, Pages 366-373

Graphs with large maximum degree containing no odd cycles of a given length

(4) Balister, Paul a Bollobás, Béla a,b Riordan, Oliver b Schelp, Richard H a

a University of Memphis (United States)

b TRINITY COLLEGE (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037374533 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1016/S0095-8956(02)00024-2 Document Type: Article

Times cited : (10)

References (13)

1
- 38149143681
- Hamiltonian properties of graphs with large neighborhood unions
- D. Bauer, G. Fan, H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Math. 96 (1991) 33-49.
- (1991) Discrete Math. , vol.96 , pp. 33-49
- Bauer, D.¹ Fan, G.² Veldman, H.J.³

2
- 0004200084
- Academic Press, London xx +
- B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978, xx + 488pp.
- (1978) Extremal Graph Theory , pp. 488
- Bollobás, B.¹

3
- 0003904891
- Springer, New York xiv +
- B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, Vol. 184, Springer, New York, 1998, xiv + 394pp.
- (1998) Modern Graph Theory, Graduate Texts in Mathematics , vol.184 , pp. 394
- Bollobás, B.¹

4
- 0013464789
- Cycles through specified vertices
- B. Bollobás, G. Brightwell, Cycles through specified vertices, Combinatorica 13 (1993) 147-155.
- (1993) Combinatorica , vol.13 , pp. 147-155
- Bollobás, B.¹ Brightwell, G.²

5
- 0000069754
- Large cycles in graphs
- J.A. Bondy, Large cycles in graphs, Discrete Math. 1 (1971) 121-132.
- (1971) Discrete Math. , vol.1 , pp. 121-132
- Bondy, J.A.¹

6
- 0002558566
- Cycles of even length in graphs
- J.A. Bondy, M. Simonovits, Cycles of even length in graphs, J. Combin. Theory Ser. B 16 (1974) 97-105.
- (1974) J. Combin. Theory Ser. B , vol.16 , pp. 97-105
- Bondy, J.A.¹ Simonovits, M.²

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

8
- 0001350401
- On maximal paths and circuits of graphs
- P. Erdos, T. Gallai, On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar 10 (1959) 337-356.
- (1959) Acta Math. Acad. Sci. Hungar , vol.10 , pp. 337-356
- Erdos, P.¹ Gallai, T.²

9
- 0013463853
- A sufficient condition on degree sums of independent triples for Hamiltonian cycles in 1-tough graphs
- B. Fassbender, A sufficient condition on degree sums of independent triples for Hamiltonian cycles in 1-tough graphs, Ars Combin. 33 (1992) 300-304.
- (1992) Ars Combin. , vol.33 , pp. 300-304
- Fassbender, B.¹

10
- 0013528490
- Hamiltonism, degree sum and neighborhood intersections
- E. Flandrin, H.A. Jung, H. Li, Hamiltonism, degree sum and neighborhood intersections, Discrete Math. 90 (1991) 41-52.
- (1991) Discrete Math. , vol.90 , pp. 41-52
- Flandrin, E.¹ Jung, H.A.² Li, H.³

11
- 0013528491
- Long cycles and neighborhood union in 1-tough graphs with large degree sums
- V.D. Hoa, Long cycles and neighborhood union in 1-tough graphs with large degree sums, Discuss. Math. Graph Theory 18 (1998) 5-13.
- (1998) Discuss. Math. Graph Theory , vol.18 , pp. 5-13
- Hoa, V.D.¹

12
- 38249015757
- Longest cycles in 3-connected planar graphs
- B. Jackson, N.C. Wormald, Longest cycles in 3-connected planar graphs, J. Combin. Theory Ser. B 54 (1992) 291-321.
- (1992) J. Combin. Theory Ser. B , vol.54 , pp. 291-321
- Jackson, B.¹ Wormald, N.C.²

13
- 84962984525
- Sufficient conditions for circuits in graphs
- D.R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. 24 (1972) 739-755.
- (1972) Proc. London Math. Soc. , vol.24 , pp. 739-755
- Woodall, D.R.¹

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