메뉴 건너뛰기




Volumn 50, Issue , 1998, Pages 292-296

Snarks and reducibility

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0040710408     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (24)

References (16)
  • 2
    • 0010005878 scopus 로고    scopus 로고
    • Fast generation of cubic graphs
    • G. Brinkmann, Fast Generation of Cubic Graphs, J. of Graph Theory 23 No. 2 (1996), 139-149.
    • (1996) J. of Graph Theory , vol.23 , Issue.2 , pp. 139-149
    • Brinkmann, G.1
  • 4
    • 0001135194 scopus 로고
    • Snarks and supersnarks
    • Y. Alavi et al. (eds.), John Wiley & Sons, New York
    • A.G. Chetwynd, R.J. Wilson, Snarks and supersnarks, in: Y. Alavi et al. (eds.) The Theory and Applications of Graphs, John Wiley & Sons, New York (1981), 215-241.
    • (1981) The Theory and Applications of Graphs , pp. 215-241
    • Chetwynd, A.G.1    Wilson, R.J.2
  • 6
    • 0000162064 scopus 로고
    • Mathematical games: Snarks, Boojums and other conjectures related to the four-color-map theorem
    • M. Gardner, Mathematical Games: Snarks, Boojums and other conjectures related to the four-color-map theorem, Sci. Am. 234 (1976), 126-130.
    • (1976) Sci. Am. , vol.234 , pp. 126-130
    • Gardner, M.1
  • 7
    • 0010961270 scopus 로고
    • Construction of class 2 graphs with maximum vertex degree 3
    • M.K. Goldberg, Construction of class 2 graphs with maximum vertex degree 3, J. of Comb. Theory, Ser. B 31 (1981), 282-291.
    • (1981) J. of Comb. Theory, Ser. B , vol.31 , pp. 282-291
    • Goldberg, M.K.1
  • 9
    • 0001634441 scopus 로고
    • Infinite families of non-trivial trivalent graphs which are not Tait colorable
    • R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Am. Math. Monthly 82 (1975), 221-239.
    • (1975) Am. Math. Monthly , vol.82 , pp. 221-239
    • Isaacs, R.1
  • 10
    • 0004010077 scopus 로고
    • Australian National University, Co mputer Science Technical Report TR-CS-84-05
    • B.D. McKay, nauty Users guide, Australian National University, Co mputer Science Technical Report TR-CS-84-05, 1984.
    • (1984) Nauty Users Guide
    • McKay, B.D.1
  • 11
    • 0039911967 scopus 로고
    • Constructing the cubic graphs on up to 20 vertices
    • B.D. McKay and G.F. Royle, Constructing the cubic graphs on up to 20 vertices, Ars Combinatoria 21 a, (1986), 129-140.
    • (1986) Ars Combinatoria , vol.21 , pp. 129-140
    • McKay, B.D.1    Royle, G.F.2
  • 12
    • 0030548383 scopus 로고    scopus 로고
    • Decompositions and reductions of snarks
    • R. Nedela, M. Škoviera, Decompositions and Reductions of Snarks, J. of Graph Theory 22 No. 3 (1996), 253-279.
    • (1996) J. of Graph Theory , vol.22 , Issue.3 , pp. 253-279
    • Nedela, R.1    Škoviera, M.2
  • 14
    • 0012908297 scopus 로고
    • Snarks of order 18
    • M. Preismann, Snarks of order 18, Disc. Math. 42 (1982), 125-126.
    • (1982) Disc. Math. , vol.42 , pp. 125-126
    • Preismann, M.1


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