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

메뉴 건너뛰기

Journal of Mathematical Chemistry

Volumn 46, Issue 2, 2009, Pages 443-447

Fullerene graphs have exponentially many perfect matchings

(4) Kardoš, František a Král', Daniel b Miškuf, Jozef a Sereni, Jean Sébastien b

a P J AFÁRIK UNIVERSITY (Slovakia)

b CHARLES UNIVERSITY (Czech Republic)

Author keywords

Fullerene; Fullerene graph; Perfect matching

Indexed keywords

EID: 67650614648 PISSN: 02599791 EISSN: None Source Type: Journal
DOI: 10.1007/s10910-008-9471-7 Document Type: Article

Times cited : (45)

References (16)

1
- 84972498411
- Every planar map is four colorable. Part I.
- K. Appel W. Haken 1977 Every planar map is four colorable. Part I. Discharging. Illinois J. Math. 21 429 490
- (1977) Discharging. Illinois J. Math. , vol.21 , pp. 429-490
- Appel, K.¹ Haken, W.²

2
- 84972500815
- Every planar map is four colorable. Part II
- K. Appel W. Haken J. Koch 1977 Every planar map is four colorable. Part II Reducibility. Illinois J. Math. 21 491 567
- (1977) Reducibility. Illinois J. Math. , vol.21 , pp. 491-567
- Appel, K.¹ Haken, W.² Koch, J.³

3
- 67650597762
- Submitted for publication
- M. Chudnovsky, P. Seymour, Perfect matchings in planar cubic graphs. Submitted for publication (2008)
- (2008) Perfect Matchings in Planar Cubic Graphs
- Chudnovsky, M.¹ Seymour, P.²

4
- 0040581129
- On lower bounds of number of perfect matchings in fullerene graphs
- T. Došlić 1998 On lower bounds of number of perfect matchings in fullerene graphs J. Math. Chem. 24 359 364 (Pubitemid 128376859)
- (1998) Journal of Mathematical Chemistry , vol.24 , Issue.4 , pp. 359-364
- Doslic, T.¹

5
- 0036486103
- On some structural properties of fullerene graphs
- T. Došlić 2002 On some structural properties of fullerene graphs J. Math. Chem. 31 187 195
- (2002) J. Math. Chem. , vol.31 , pp. 187-195
- Došlić, T.¹

6
- 0347132502
- Cyclical edge-connectivity of fullerene graphs and (k, 6)-cages
- DOI 10.1023/A:1023299815308
- T. Došlić 2003 Cyclical edge-connectivity of fullerene graphs and (k,6)-cages J. Math. Chem 33 103 112 (Pubitemid 38101889)
- (2003) Journal of Mathematical Chemistry , vol.33 , Issue.2 , pp. 103-112
- Doslic, T.¹

7
- 33847639404
- Fullerene graphs with exponentially many perfect matchings
- T. Došlić 2007 Fullerene graphs with exponentially many perfect matchings J. Math. Chem. 42 2 183 192
- (2007) J. Math. Chem. , vol.42 , Issue.2 , pp. 183-192
- Došlić, T.¹

8
- 43249104217
- Leapfrog fullerenes have many perfect matchings
- T. Došlić 2008 Leapfrog fullerenes have many perfect matchings J. Math. Chem. 44 1 1 4
- (2008) J. Math. Chem. , vol.44 , Issue.1 , pp. 1-4
- Došlić, T.¹

9
- 0000307033
- Choosability in graphs
- P. Erdos A.L. Rubin H. Taylor 1980 Choosability in graphs Congr. Numer. 26 122 157
- (1980) Congr. Numer. , vol.26 , pp. 122-157
- Erdos, P.¹ Rubin, A.L.² Taylor, H.³

10
- 43249096548
- Cyclic edge-cuts in fullerene graphs
- F. Kardoš R. Škrekovski 2008 Cyclic edge-cuts in fullerene graphs J. Math. Chem. 44 1 121 132
- (2008) J. Math. Chem. , vol.44 , Issue.1 , pp. 121-132
- Kardoš, F.¹ Škrekovski, R.²

11
- 0000243963
- Theorems for carbon cages
- D.J. Klein X. Liu 1992 Theorems for carbon cages J. Math. Chem 11 199 205
- (1992) J. Math. Chem , vol.11 , pp. 199-205
- Klein, D.J.¹ Liu, X.²

12
- 1542743726
- 60 Buckminsterfullerene
- 60 Buckminsterfullerene Nature 318 162 163
- (1985) Nature , vol.318 , pp. 162-163
- Kroto, H.W.¹ Heath, J.R.² O'Brien, S.C.³ Curl, R.F.⁴ Smalley, R.E.⁵

13
- 43249086712
- Preprint, arXiv:math-CO/0702511
- K. Kutnar, D. Marušič, On cyclic edge-connectivity of fullerenes. Preprint, arXiv:math-CO/0702511
- On Cyclic Edge-connectivity of Fullerenes
- Kutnar, K.¹ Marušič, D.²

14
- 0031146074
- The four colour theorem
- N. Robertson D.P. Sanders P.D. Seymour R. Thomas 1997 The four colour theorem J. Combin. Theory Ser. B 70 2 44
- (1997) J. Combin. Theory Ser. B , vol.70 , pp. 2-44
- Robertson, N.¹ Sanders, D.P.² Seymour, P.D.³ Thomas, R.⁴

15
- 0002221232
- Colouring the vertices of a graph in prescribed colours (in Russian)
- V.G. Vizing 1976 Colouring the vertices of a graph in prescribed colours (in Russian) Diskret. Anal. 29 3 10
- (1976) Diskret. Anal. , vol.29 , pp. 3-10
- Vizing, V.G.¹

16
- 0035471115
- New lower bound on the number of perfect matchings in fullerene graphs
- DOI 10.1023/A:1015131912706
- H. Zhang F. Zhang 2001 New lower bound on the number of perfect matchings in fullerene graphs. J. Math Chem. 30 343 347 (Pubitemid 33401935)
- (2001) Journal of Mathematical Chemistry , vol.30 , Issue.3 , pp. 343-347
- Zhang, H.¹ Zhang, F.²

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