메뉴 건너뛰기




Volumn 15, Issue 4, 1999, Pages 429-439

Contractible non-edges in triangle-free graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000630927     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730050051     Document Type: Article
Times cited : (6)

References (11)
  • 2
    • 0013019857 scopus 로고
    • Distribution of contractible edges in k-connected graphs
    • Dean, N.: "Distribution of contractible edges in k-connected graphs", J. Comb. Theory, Ser. B 48(1), 1-5 (1990)
    • (1990) J. Comb. Theory, Ser. B , vol.48 , Issue.1 , pp. 1-5
    • Dean, N.1
  • 3
    • 84987590271 scopus 로고
    • Covering contractible edges in 3-connected graphs. II: Characterizing those with covers of size three
    • Hemminger, R.L., Yu, X.: "Covering contractible edges in 3-connected graphs. II: Characterizing those with covers of size three", J. Graph Theory 17 (2), 274-252 (1993)
    • (1993) J. Graph Theory , vol.17 , Issue.2 , pp. 274-1252
    • Hemminger, R.L.1    Yu, X.2
  • 5
    • 0001011005 scopus 로고
    • Endlichkeitssätze für k-kritische Graphen
    • Mader, W.: "Endlichkeitssätze für k-kritische Graphen", Math. Ann. 229, 143-153 (1977)
    • (1977) Math. Ann. , vol.229 , pp. 143-153
    • Mader, W.1
  • 6
    • 38249029615 scopus 로고
    • Generalizations of critical connectivity of graphs
    • Mader, W.: "Generalizations of critical connectivity of graphs", Discrete Math. 72, 267-283 (1988)
    • (1988) Discrete Math. , vol.72 , pp. 267-283
    • Mader, W.1
  • 7
    • 84974055089 scopus 로고
    • On vertex-edge critically n-connected graphs
    • Mader, W.: "On vertex-edge critically n-connected graphs", Comb. Probab. Comput. 3 (2), 257-271 (1994)
    • (1994) Comb. Probab. Comput. , vol.3 , Issue.2 , pp. 257-271
    • Mader, W.1
  • 8
    • 84986483927 scopus 로고
    • Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets
    • Saito, A.: "Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets", J. Graph Theory 14 (6), 635-643 (1990)
    • (1990) J. Graph Theory , vol.14 , Issue.6 , pp. 635-643
    • Saito, A.1
  • 9
    • 85012714469 scopus 로고
    • Nonseparating cycles in k-connected graphs
    • Thomassen, C.: "Nonseparating cycles in k-connected graphs", J. Graph Theory 5, 351-354 (1981)
    • (1981) J. Graph Theory , vol.5 , pp. 351-354
    • Thomassen, C.1
  • 10
    • 84989906901 scopus 로고
    • Kuratowski's Theorem
    • Thomassen, C.: "Kuratowski's Theorem", J. Graph Theory 5, 225-241 (1981)
    • (1981) J. Graph Theory , vol.5 , pp. 225-241
    • Thomassen, C.1


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