SCOPUS 정보 검색 플랫폼

Volumn 15, Issue 5, 2006, Pages 685-694

On sufficient degree conditions for a graph to be k-linked

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; MATHEMATICAL MODELS;

2K-CONNECTED GRAPH; DISJOINT PATHS; N-VERTEX GRAPH;

GRAPH THEORY;

EID: 33746649767 PISSN: 09635483 EISSN: 14692163 Source Type: Journal
DOI: 10.1017/S0963548305007479 Document Type: Article

Times cited : (49)

References (14)

1
- 0042997112
- Highly linked graphs
- Bollobás, B. and Thomason, A. (1996) Highly linked graphs. Combinatorica 16 313-320.
- (1996) Combinatorica , vol.16 , pp. 313-320
- Bollobás, B.¹ Thomason, A.²

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

3
- 0347109874
- Vertex-disjoint cycles containing specified edges
- Egawa, Y., Faudree, R. J., Gyori, E., Ishigami, Y., Schelp, R. H. and Wang, H. (2000) Vertex-disjoint cycles containing specified edges. Graphs Combin. 16 81-92.
- (2000) Graphs Combin. , vol.16 , pp. 81-92
- Egawa, Y.¹ Faudree, R.J.² Gyori, E.³ Ishigami, Y.⁴ Schelp, R.H.⁵ Wang, H.⁶

4
- 0034370734
- On k-ordered graphs
- Faudree, J., Faudree, R., Gould, R., Jacobson, M. and Lesniak, L. (2000) On k-ordered graphs. J. Graph Theory 35 69-82.
- (2000) J. Graph Theory , vol.35 , pp. 69-82
- Faudree, J.¹ Faudree, R.² Gould, R.³ Jacobson, M.⁴ Lesniak, L.⁵

5
- 0037900665
- Advances on the Hamiltonian problem: A survey
- Gould, R. J. (2003) Advances on the Hamiltonian problem: A survey. Graphs Combin. 19 7-52.
- (2003) Graphs Combin. , vol.19 , pp. 7-52
- Gould, R.J.¹

6
- 0037340248
- Degree conditions for k-ordered Hamiltonian graphs
- Gould, R. J., Kostochka, A. V., Lesniak, L., Schiermeyer, I. and Saito, A. (2003) Degree conditions for k-ordered Hamiltonian graphs. J. Graph Theory 42 199-210.
- (2003) J. Graph Theory , vol.42 , pp. 199-210
- Gould, R.J.¹ Kostochka, A.V.² Lesniak, L.³ Schiermeyer, I.⁴ Saito, A.⁵

7
- 0002775018
- Verallgemeinerung des n-fachen Zusammenhangs für Graphen
- Jung, H. A. (1970) Verallgemeinerung des n-fachen Zusammenhangs für Graphen. Math. Annalen 187 95-103.
- (1970) Math. Annalen , vol.187 , pp. 95-103
- Jung, H.A.¹

8
- 0039008403
- On k-ordered Hamiltonian graphs
- Kierstead, H. A., Sárközy, G. and Selkow, S. (1999) On k-ordered Hamiltonian graphs. J. Graph Theory 32 17-25.
- (1999) J. Graph Theory , vol.32 , pp. 17-25
- Kierstead, H.A.¹ Sárközy, G.² Selkow, S.³

9
- 84963043370
- On the existence of certain configurations within graphs and the 1-skeletons of polytopes
- Larman, D. G. and Mani, P. (1974) On the existence of certain configurations within graphs and the 1-skeletons of polytopes. Proc. London Math. Soc. 20 144-160.
- (1974) Proc. London Math. Soc. , vol.20 , pp. 144-160
- Larman, D.G.¹ Mani, P.²

10
- 0000079797
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Mader, W. (1967) Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Annalen 174 265-268.
- (1967) Math. Annalen , vol.174 , pp. 265-268
- Mader, W.¹

11
- 0031541218
- Hamiltonian graphs
- Ng, L. and Schnitz, M. (1997) k-ordered Hamiltonian graphs. J. Graph Theory 2 45-57.
- (1997) J. Graph Theory , vol.2 , pp. 45-57
- Ng, L.¹ Schnitz, M.²

12
- 0002297833
- Note on Hamilton circuits
- Ore, O. (1960) Note on Hamilton circuits. Amer. Math. Monthly 67 55.
- (1960) Amer. Math. Monthly , vol.67 , pp. 55
- Ore, O.¹

13
- 0002848005
- Graph minors XIII: The disjoint path problem
- Robertson, N. and Seymour, P. D. (1995) Graph minors XIII: The disjoint path problem. J. Combin. Theory Ser. B, 63 65-110.
- (1995) J. Combin. Theory Ser. B , vol.63 , pp. 65-110
- Robertson, N.¹ Seymour, P.D.²

14
- 4644303380
- Submitted
- Thomas, R. and Wollan, P. (2003) An improved linear edge bound for graph linkage. Submitted.
- (2003) An Improved Linear Edge Bound for Graph Linkage
- Thomas, R.¹ Wollan, P.²

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