메뉴 건너뛰기
Graphs and Combinatorics
Volumn 12, Issue 1, 1996, Pages 17-22
The toughness of cubic graphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 25644442434     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01858441     Document Type: Article
Times cited : (3)
References (10)
  • 1
    • 4344706571 scopus 로고
    • Brooks' graph-coloring theorem and the independence number
    • Catlin, P.: Brooks' graph-coloring theorem and the independence number. J. Combin. Theory Ser. B 27, 42-48 (1979)
    • (1979) J. Combin. Theory Ser. B , vol.27 , pp. 42-48
    • Catlin, P.1
  • 2
    • 0009861251 scopus 로고
    • A note on the toughness of generalized Petersen graphs
    • Chao, C., Han, C.: A note on the toughness of generalized Petersen graphs. J. Math. Res. Exposition 12, 183-186 (1992)
    • (1992) J. Math. Res. Exposition , vol.12 , pp. 183-186
    • Chao, C.1    Han, C.2
  • 3
    • 36949016322 scopus 로고
    • Tough graphs and hamiltonian circuits
    • Chvátal V.: Tough graphs and hamiltonian circuits. Discrete Math. 5, 215-228 (1973)
    • (1973) Discrete Math. , vol.5 , pp. 215-228
    • Chvátal, V.1
  • 4
    • 0002348235 scopus 로고
    • On the toughness of some generalized Petersen graphs
    • Ferland, K.: On the toughness of some generalized Petersen graphs. Ars Combin. 36, 65-88 (1993)
    • (1993) Ars Combin. , vol.36 , pp. 65-88
    • Ferland, K.1
  • 5
    • 0004736285 scopus 로고
    • On the toughness of a graph
    • Goddard, W., Swart, H.C.: On the toughness of a graph. Quaestiones Math. 13, 217-232 (1990)
    • (1990) Quaestiones Math. , vol.13 , pp. 217-232
    • Goddard, W.1    Swart, H.C.2
  • 6
    • 0040935823 scopus 로고
    • A characterization of 3/2-tough cubic graphs
    • Jackson, B., Katerinis, P.: A characterization of 3/2-tough cubic graphs. Ars Combin. 38, 145-148 (1994)
    • (1994) Ars Combin. , vol.38 , pp. 145-148
    • Jackson, B.1    Katerinis, P.2
  • 7
    • 84986506423 scopus 로고
    • Hamiltonian results in K(1, 3)-free graphs
    • Matthews, M., Sumner, D.: Hamiltonian results in K(1, 3)-free graphs. J. Graph Theory 8, 139-146 (1984)
    • (1984) J. Graph Theory , vol.8 , pp. 139-146
    • Matthews, M.1    Sumner, D.2
  • 8
    • 0009864204 scopus 로고
    • On the vulnerability of cycle permutation graphs
    • Piazza, B., Ringeisen, R., Stueckle, S.: On the vulnerability of cycle permutation graphs. Ars Combin. 29, 289-296 (1990)
    • (1990) Ars Combin. , vol.29 , pp. 289-296
    • Piazza, B.1    Ringeisen, R.2    Stueckle, S.3
  • 9
    • 0039799161 scopus 로고
    • On the toughness of a graph
    • Springer Verlag
    • Pippert, R.: On the toughness of a graph. Lecture Notes in Math, vol 303 pp. 225-233, Springer Verlag, 1972
    • (1972) Lecture Notes in Math , vol.303 , pp. 225-233
    • Pippert, R.1
  • 10
    • 0010989747 scopus 로고
    • Some Ramsey-type numbers and the independence ratio
    • Staton, W.: Some Ramsey-type numbers and the independence ratio. Trans. Amer. Math. Soc. 256, 353-370 (1979)
    • (1979) Trans. Amer. Math. Soc. , vol.256 , pp. 353-370
    • Staton, W.1

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