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

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 2, 2006, Pages 296-301

Non-zero disjoint cycles in highly connected group labelled graphs

(2) Kawarabayashi, Ken Ichi a Wollan, Paul b

a TOHOKU UNIVERSITY (Japan)

b GEORGIA INSTITUTE OF TECHNOLOGY (United States)

Author keywords

Group labelled graphs; Highly connected graphs; Non zero disjoint cycles

Indexed keywords

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

Times cited : (36)

References (16)

1
- 29244468632
- Linear connectivity forces large complete bipartite graph minors
- preprint
- T. Böhme, K. Kawarabayashi, J. Maharry, B. Mohar, Linear connectivity forces large complete bipartite graph minors, preprint.
- Böhme, T.¹ Kawarabayashi, K.² Maharry, J.³ Mohar, B.⁴

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

3
- 32544450344
- Packing non-zero A-paths in group labeled graphs
- preprint
- M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman, P. Seymour, Packing non-zero A-paths in group labeled graphs, preprint.
- Chudnovsky, M.¹ Geelen, J.² Gerards, B.³ Goddyn, L.⁴ Lohman, M.⁵ Seymour, P.⁶

4
- 0003677229
- second ed., Berlin: Springer
- R. Diestel Graph Theory second ed. 2000 Springer Berlin
- (2000) Graph Theory
- Diestel, R.¹

5
- 0002023317
- On the maximal number of disjoint circuits of a graph
- P. Erdös L. Pósa On the maximal number of disjoint circuits of a graph Publ. Math. Debrecen 9 1962 3-12
- (1962) Publ. Math. Debrecen , vol.9 , pp. 3-12
- Erdös, P.¹ Pósa, L.²

6
- 0002775018
- Verallgemeinerung des n-fahen zusammenhangs für Graphen
- H.A. Jung Verallgemeinerung des n-fahen zusammenhangs für Graphen Math. Ann. 187 1970 95-103
- (1970) Math. Ann. , vol.187 , pp. 95-103
- Jung, H.A.¹

7
- 33746649767
- On sufficient degree conditions for a graph to be k-linked
- to appear
- K. Kawarabayashi, A. Kostochka, G. Yu, On sufficient degree conditions for a graph to be k-linked, Combin. Probab. Comput., to appear.
- Combin. Probab. Comput.
- Kawarabayashi, K.¹ Kostochka, A.² Yu, G.³

8
- 32544460711
- The Erdos-Pósa property for vertex- and edge-disjoint odd cycles on an orientable fixed surface
- preprint
- K. Kawarabayashi, A. Nakamoto, The Erdos-Pósa property for vertex- and edge-disjoint odd cycles on an orientable fixed surface, preprint.
- Kawarabayashi, K.¹ Nakamoto, A.²

9
- 32544461014
- Highly parity linked graphs
- preprint
- K. Kawarabayashi, B. Reed, Highly parity linked graphs, preprint.
- Kawarabayashi, K.¹ Reed, B.²

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

11
- 0035657062
- The Erdos-Pósa property for odd cycles in highly connected graphs
- D. Rautenbach B. Reed The Erdos-Pósa property for odd cycles in highly connected graphs Combinatorica 21 2001 267-278
- (2001) Combinatorica , vol.21 , pp. 267-278
- Rautenbach, D.¹ Reed, B.²

12
- 0038929410
- Mangoes and blueberries
- B. Reed Mangoes and blueberries Combinatorica 19 1999 267-296
- (1999) Combinatorica , vol.19 , pp. 267-296
- Reed, B.¹

13
- 0007372224
- Matroid minors
- R.L. Graham M. Grötschel L. Lóvasz North-Holland Amsterdam
- P. Seymour Matroid minors R.L. Graham M. Grötschel L. Lóvasz Handbook of Combinatorics 1985 North-Holland Amsterdam 419-431
- (1985) Handbook of Combinatorics , pp. 419-431
- Seymour, P.¹

14
- 12944270357
- An improved linear edge bound for graph linkages
- R. Thomas P. Wollan An improved linear edge bound for graph linkages European J. Combin. 26 2005 309-324
- (2005) European J. Combin. , vol.26 , pp. 309-324
- Thomas, R.¹ Wollan, P.²

15
- 84986465543
- On the presence of disjoint subgraphs of a specified type
- C. Thomassen On the presence of disjoint subgraphs of a specified type J. Graph Theory 12 1988 101-110
- (1988) J. Graph Theory , vol.12 , pp. 101-110
- Thomassen, C.¹

16
- 0035655378
- The Erdos-Pósa property for odd cycles in graphs with large connectivity
- C. Thomassen The Erdos-Pósa property for odd cycles in graphs with large connectivity Combinatorica 21 2001 321-333
- (2001) Combinatorica , vol.21 , pp. 321-333
- Thomassen, C.¹

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