메뉴 건너뛰기




Volumn 179, Issue 1-3, 1998, Pages 185-203

On contractible and vertically contractible elements in 3-connected matroids and graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042416978     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00385-8     Document Type: Article
Times cited : (9)

References (23)
  • 1
    • 84971722436 scopus 로고
    • Some local extremal connectivity results for matroids
    • S. Akkari and J.G. Oxley, Some local extremal connectivity results for matroids, Combin. Probab. Comput. 2 (1993) 367-384.
    • (1993) Combin. Probab. Comput. , vol.2 , pp. 367-384
    • Akkari, S.1    Oxley, J.G.2
  • 2
    • 84987486538 scopus 로고
    • The 3-connected graphs having a longest cycle containing only three contractible edges
    • R.E.L. Aldred, R.L. Hemminger and K. Ota, The 3-connected graphs having a longest cycle containing only three contractible edges, J. Graph Theory 17 (1993) 361-371.
    • (1993) J. Graph Theory , vol.17 , pp. 361-371
    • Aldred, R.E.L.1    Hemminger, R.L.2    Ota, K.3
  • 4
    • 0000670517 scopus 로고
    • A simple theorem on 3-connectivity
    • R.E. Bixby, A simple theorem on 3-connectivity, Linear Algebra Appl. 45 (1982) 123-126.
    • (1982) Linear Algebra Appl. , vol.45 , pp. 123-126
    • Bixby, R.E.1
  • 6
    • 84967771322 scopus 로고
    • Modular constructions for combinatorial geometries
    • T.H. Brylawski, Modular constructions for combinatorial geometries, Trans. Amer. Math. Soc. 203 (1975) 1-44.
    • (1975) Trans. Amer. Math. Soc. , vol.203 , pp. 1-44
    • Brylawski, T.H.1
  • 8
    • 84986486999 scopus 로고
    • Longest cycles in 3-connected graphs contain three contractible edges
    • N. Dean, R.L. Hemminger and K. Ota, Longest cycles in 3-connected graphs contain three contractible edges, J. Graph Theory 12 (1989) 17-21.
    • (1989) J. Graph Theory , vol.12 , pp. 17-21
    • Dean, N.1    Hemminger, R.L.2    Ota, K.3
  • 9
    • 51249177620 scopus 로고
    • Contractible edges in triangle-free graphs
    • Y. Egawa, Y. Enomoto and A. Saito, Contractible edges in triangle-free graphs, Combinatorica 6 (1986) 269-274.
    • (1986) Combinatorica , vol.6 , pp. 269-274
    • Egawa, Y.1    Enomoto, Y.2    Saito, A.3
  • 10
    • 38249023792 scopus 로고
    • On 3-connected matroids
    • M. Lemos, On 3-connected matroids, Discrete Math. 73 (1989) 273-283.
    • (1989) Discrete Math. , vol.73 , pp. 273-283
    • Lemos, M.1
  • 13
    • 0041590075 scopus 로고
    • On 3-connected matroids
    • J.G. Oxley, On 3-connected matroids, Canad. J. Math. 33 (1981) 20-27.
    • (1981) Canad. J. Math. , vol.33 , pp. 20-27
    • Oxley, J.G.1
  • 14
    • 84971172629 scopus 로고
    • On a matroid generalization of graph connectivity
    • J.G. Oxley, On a matroid generalization of graph connectivity, Math. Proc. Camb. Phil. Soc. 90 (1981) 207-214.
    • (1981) Math. Proc. Camb. Phil. Soc. , vol.90 , pp. 207-214
    • Oxley, J.G.1
  • 15
    • 0004061262 scopus 로고
    • Oxford Univ. Press, New York
    • J.G. Oxley, Matroid Theory (Oxford Univ. Press, New York, 1992).
    • (1992) Matroid Theory
    • Oxley, J.G.1
  • 16
    • 0042091168 scopus 로고
    • On matroid connectivity
    • J.G. Oxley and H. Wu, On matroid connectivity, Discrete Math. 146 (1995) 321-324.
    • (1995) Discrete Math. , vol.146 , pp. 321-324
    • Oxley, J.G.1    Wu, H.2
  • 19
    • 49149147896 scopus 로고
    • Decomposition of regular matroids
    • P.D. Seymour, Decomposition of regular matroids, J. Combin. Theory Ser. B 28 (1980) 305-359.
    • (1980) J. Combin. Theory Ser. B , vol.28 , pp. 305-359
    • Seymour, P.D.1
  • 20
    • 85025535620 scopus 로고
    • Planarity and duality of finite and infinite graphs
    • C. Thomassen, Planarity and duality of finite and infinite graphs, J. Combin. Theory Ser. B 29 (1980) 244-271.
    • (1980) J. Combin. Theory Ser. B , vol.29 , pp. 244-271
    • Thomassen, C.1
  • 21
    • 0001274679 scopus 로고
    • Non-separating induced cycles in graphs
    • C. Thomassen and B. Toft, Non-separating induced cycles in graphs, J. Combin. Theory Ser. B 31 (1981) 199-224.
    • (1981) J. Combin. Theory Ser. B , vol.31 , pp. 199-224
    • Thomassen, C.1    Toft, B.2
  • 23
    • 0000444115 scopus 로고
    • Connectivity in matroids
    • W.T. Tutte, Connectivity in matroids, Canad. J. Math. 18 (1966) 1301-1324.
    • (1966) Canad. J. Math. , vol.18 , pp. 1301-1324
    • Tutte, W.T.1


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