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

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 2, 2001, Pages 306-315

All 4-connected line graphs of claw free graphs are hamiltonian connected

(1) Kriesell, Matthias a

a LEIBNIZ UNIVERSITY HANNOVER (Germany)

Author keywords

Hamiltonian graph; hamiltonian connected graph; eulerian graph; claw free graph; line graph

Indexed keywords

EID: 0035402226 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1006/jctb.2001.2040 Document Type: Article

Times cited : (19)

References (16)

1
- 0003524084
- New York: MacMillan
- Bondy J. A., Murty U. S. R. Graph Theory with Applications. 1976;MacMillan, New York.
- (1976) Graph Theory with Applications
- Bondy J., A.¹ Murty U. S., R.²

2
- 85086481288
- On factors of 4-connected claw-free graphs
- in press.
- H. J. Broersma, M. Kriesell, and, Z. Ryjáček, On factors of 4-connected claw-free graphs, J. Graph Theory, in press.
- J. Graph Theory
- H. J. Broersma¹ M. Kriesell² Z. Ryjáček³

3
- 0003335779
- Graph Theory
- Berlin/New York: Springer-Verlag
- Diestel R. Graph Theory. Graduate Texts in Mathematics. 173:1997;Springer-Verlag, Berlin/New York.
- (1997) Graduate Texts in Mathematics , vol.173
- Diestel, R.¹

4
- 0007088770
- Flows and generalized colouring theorems in graphs
- Jaeger F. Flows and generalized colouring theorems in graphs. J. Combin. Theory Ser. B. 26:1979;205-216.
- (1979) J. Combin. Theory Ser. B , vol.26 , pp. 205-216
- Jaeger, F.¹

5
- 0007032240
- On k-critically connected line graphs
- Kriesell M. On k-critically connected line graphs. J. Combin. Theory Ser. B. 74:1998;1-7.
- (1998) J. Combin. Theory Ser. B , vol.74 , pp. 1-7
- Kriesell, M.¹

6
- 0007034357
- Every 4-connected line graph of a planar graph is hamiltonian
- Lai H.-J. Every 4-connected line graph of a planar graph is hamiltonian. Graphs Combin. 10:1994;249-253.
- (1994) Graphs Combin. , vol.10 , pp. 249-253
- Lai, H.-J.¹

7
- 0002045578
- On k-critically n-connected graphs
- Mader W. On k-critically n-connected graphs. Progr. Graph Theory. 1984;389-398.
- (1984) Progr. Graph Theory , pp. 389-398
- Mader, W.¹

8
- 84986506423
- 1, 3-free graphs
- 1, 3-free graphs. J. Graph Theory. 8:1984;139-146.
- (1984) J. Graph Theory , vol.8 , pp. 139-146
- Matthews M., M.¹ Sumner D., P.²

9
- 84881100274
- Edge-disjoint spanning trees of finite graphs
- Nash-Williams C. St. J. A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36:1961;445-450.
- (1961) J. London Math. Soc. , vol.36 , pp. 445-450
- Nash-Williams C. St. J., A.¹

10
- 0000821949
- The interchange graph of a finite graph
- van Rooij A., Wilf H. The interchange graph of a finite graph. Acta Math. Acad. Sci. Hungar. 16:1965;263-269.
- (1965) Acta Math. Acad. Sci. Hungar. , vol.16 , pp. 263-269
- Van Rooij, A.¹ Wilf, H.²

11
- 0000964940
- On a closure concept in claw-free graphs
- Ryjáček Z. On a closure concept in claw-free graphs. J. Combin. Theory Ser. B. 70:1997;217-224.
- (1997) J. Combin. Theory Ser. B , vol.70 , pp. 217-224
- Ryjáček, Z.¹

12
- 0003556557
- Amsterdam: North-Holland. p. 463
- Thomassen C. Cycles in Graphs, Burnaby, 1982. 1985;North-Holland, Amsterdam. p. 463.
- (1985) Cycles in Graphs, Burnaby, 1982
- Thomassen, C.¹

13
- 84986450045
- Reflections on graph theory
- Thomassen C. Reflections on graph theory. J. Graph Theory. 10:1986;309-324.
- (1986) J. Graph Theory , vol.10 , pp. 309-324
- Thomassen, C.¹

14
- 84963041976
- On the problem of decomposing a graph into n connected factors
- Tutte W. T. On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36:1961;221-230.
- (1961) J. London Math. Soc. , vol.36 , pp. 221-230
- Tutte W., T.¹

15
- 0007035770
- Hamiltonian connectedness of line graphs
- Zhan S. Hamiltonian connectedness of line graphs. Ars Combin. 22:1986;89-95.
- (1986) Ars Combin. , vol.22 , pp. 89-95
- Zhan, S.¹

16
- 0000578685
- On hamiltonian line graphs and connectivity
- Zhan S. On hamiltonian line graphs and connectivity. Discrete Math. 89:1991;89-95.
- (1991) Discrete Math. , vol.89 , pp. 89-95
- Zhan, S.¹

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