Contractible Non-edges in 3-Connected Graphs

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 2, 1998, Pages 192-201

  Kriesell, Matthias ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000294037     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1842     Document Type: Article

References (8)

1. Ando K., Enomoto H., Saito A. Contractible edges in 3-connected graphs. J. Combin Theory Ser. B. 42:1987;87-93.
2. Dean N. Distribution of contractible edges ink. J. Combin. Theory Ser. B. 48:1990;1-5.
3. Hemminger R. L., Yu X. Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. J. Graph Theory. 17:1993;247-252.
4. Mader W. Endlichkeitssätze fürk. Math. Ann. 229:1977;143-153.
5. Mader W. Generalizations of critical connectivity of graphs. Discrete Math. 72:1988;267-283.
6. Saito A. Covering contractible edges in 3-connected graphs. I. Covers of size three are cutsets. J. Graph Theory. 14:1990;635-643.
7. Thomassen C. Kuratowski's theorem. J. Graph Theory. 5:1981;225-241.
8. Tutte W. T. A theory of 3-connected graphs. Nederl. Akad. Wetensch. Proc. Ser. A. 64:1961;441-455.