A characterization of 3-connected graphs containing a given graph

Seiya Negami. A characterization of 3-connected graphs containing a given graph. Journal of Combinatorial Theory, Series A, 32(1):69-74, 1982. [doi]

Abstract

Abstract is missing.