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

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 90, Issue 2, 2004, Pages 315-323

Cycles through a prescribed vertex set in N-connected graphs

(1) Kawarabayashi, Ken Ichi a

a PRINCETON UNIVERSITY (United States)

Author keywords

Cycles; n connected graphs

Indexed keywords

EID: 1442355425 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1016/j.jctb.2003.08.002 Document Type: Article

Times cited : (8)

References (18)

1
- 84986468668
- An 11-vertex theorem for 3-connected cubic graphs
- R.E.L. Aldred, S. Bau, D.A. Holton, G.F. Royle, An 11-vertex theorem for 3-connected cubic graphs, J. Graph Theory 12 (1988) 561-570.
- (1988) J. Graph Theory , vol.12 , pp. 561-570
- Aldred, R.E.L.¹ Bau, S.² Holton, D.A.³ Royle, G.F.⁴

2
- 84987574155
- Cycles containing 12 vertices in any 3-connected cubic graph
- S. Bau, D.A. Holton, Cycles containing 12 vertices in any 3-connected cubic graph, J. Graph Theory 15 (1991) 421-429.
- (1991) J. Graph Theory , vol.15 , pp. 421-429
- Bau, S.¹ Holton, D.A.²

3
- 51249179655
- Cycles through specified vertices of a graph
- J.A. Bondy, L. Lovász, Cycles through specified vertices of a graph, Combinatorica 1 (1981) 117-140.
- (1981) Combinatorica , vol.1 , pp. 117-140
- Bondy, J.A.¹ Lovász, L.²

4
- 0004275036
- 3rd Edition, Chapman & Hall, London
- G. Chartrand, L. Lesniak, Graph and Digraphs, 3rd Edition, Chapman & Hall, London, 1996.
- (1996) Graph and Digraphs
- Chartrand, G.¹ Lesniak, L.²

5
- 0003335779
- Graph Theory
- Springer, Berlin
- R. Diestel, Graph Theory, in: Graduate Texts in Mathematics, Vol. 173, Springer, Berlin, 1997.
- (1997) Graduate Texts in Mathematics , vol.173
- Diestel, R.¹

6
- 84910437922
- In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre unterteilungen
- G.A. Dirac, In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre unterteilungen, Math. Nachr. 22 (1960) 61-85.
- (1960) Math. Nachr. , vol.22 , pp. 61-85
- Dirac, G.A.¹

7
- 51249180102
- Cycles through ten vertices in 3-connected cubic graphs
- M.N. Ellingham, D.A. Holton, C.H.C. Little, Cycles through ten vertices in 3-connected cubic graphs, Combinatorica 4 (1984) 265-273.
- (1984) Combinatorica , vol.4 , pp. 265-273
- Ellingham, M.N.¹ Holton, D.A.² Little, C.H.C.³

8
- 31244436124
- Circuits through prescribed vertices in k-connected k-regular graphs
- R. Häggkvist, W. Mader, Circuits through prescribed vertices in k-connected k-regular graphs, J. Graph Theory 39 (2002) 145-163.
- (2002) J. Graph Theory , vol.39 , pp. 145-163
- Häggkvist, R.¹ Mader, W.²

9
- 0001800821
- Circuits through specified edges
- R. Häggkvist, C. Thomassen, Circuits through specified edges, Discrete Math. 41 (1982) 29-34.
- (1982) Discrete Math. , vol.41 , pp. 29-34
- Häggkvist, R.¹ Thomassen, C.²

10
- 1442330663
- Cycles through specified vertices in k-connected regular graphs
- D.A. Holton, Cycles through specified vertices in k-connected regular graphs, Ars Combin. 13 (1982) 129-143.
- (1982) Ars Combin. , vol.13 , pp. 129-143
- Holton, D.A.¹

11
- 51249184658
- A nine point theorem for 3-connected graphs
- D.A. Holton, B.D. McKay, M.D. Plummer, C. Thomassen, A nine point theorem for 3-connected graphs, Combinatorica 2 (1982) 53-62.
- (1982) Combinatorica , vol.2 , pp. 53-62
- Holton, D.A.¹ McKay, B.D.² Plummer, M.D.³ Thomassen, C.⁴

12
- 0000822468
- Cycles through prescribed and forbidden point sets
- D.A. Holton, M.D. Plummer, Cycles through prescribed and forbidden point sets, Ann. Discrete Math. 16 (1982) 129-147.
- (1982) Ann. Discrete Math. , vol.16 , pp. 129-147
- Holton, D.A.¹ Plummer, M.D.²

13
- 84987490981
- Cycles intersecting a prescribed vertex set
- A. Kaneko, A. Saito, Cycles intersecting a prescribed vertex set, J. Graph Theory 15 (6) (1991) 655-664.
- (1991) J. Graph Theory , vol.15 , Issue.6 , pp. 655-664
- Kaneko, A.¹ Saito, A.²

14
- 0036170713
- One or two disjoint circuits cover independent edges, Loväsz-Woodall conjecture
- K. Kawarabayashi, One or two disjoint circuits cover independent edges, Loväsz-Woodall conjecture, J. Combin. Theory Ser. B 84 (2002) 1-44.
- (2002) J. Combin. Theory Ser. B , vol.84 , pp. 1-44
- Kawarabayashi, K.¹

15
- 34547499007
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- A.K. Kelmans, M.V. Lomonosov, When m vertices in a k-connected graph cannot be walked round along a simple cycle, Discrete Math. 38 (1982) 317-322.
- (1982) Discrete Math. , vol.38 , pp. 317-322
- Kelmans, A.K.¹ Lomonosov, M.V.²

16
- 1442306332
- Cyclicability of r-regular r-connected graphs
- W.D. McCuaig, M. Rosenfeld, Cyclicability of r-regular r-connected graphs, Bull. Austral. Math. Soc. 29 (1984) 1-11.
- (1984) Bull. Austral. Math. Soc. , vol.29 , pp. 1-11
- McCuaig, W.D.¹ Rosenfeld, M.²

17
- 0040516653
- Applications of Menger's graph theorem
- H. Perfect, Applications of Menger's graph theorem, J. Math. Anal. Appl. 22 (1968) 96-111.
- (1968) J. Math. Anal. Appl. , vol.22 , pp. 96-111
- Perfect, H.¹

18
- 0039331334
- Cycles and connectivity in graphs
- M.E. Watkins, D.M. Mesner, Cycles and connectivity in graphs, Can. J. Math. 19 (1967) 1319-1328.
- (1967) Can. J. Math. , vol.19 , pp. 1319-1328
- Watkins, M.E.¹ Mesner, D.M.²

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