Ein Algorithmus zur Konstruktion gegebener 3-zusammenhängender Graphen, 2006. ,
On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs, Lecture Notes in Mathematics, vol.46, pp.27-40, 1969. ,
DOI : 10.1016/S1385-7258(61)50045-5
Designing programs that check their work, STOC '89, pp.86-97, 1989. ,
The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, vol.5, issue.4 ,
DOI : 10.1137/0205049
Zur Theorie der n-fach zusammenhängenden Graphen, pp.133-164, 1969. ,
Dividing a Graph into Triconnected Components, SIAM Journal on Computing, vol.2, issue.3, pp.135-158, 1973. ,
DOI : 10.1137/0202012
Graph expansion and reduction. Algebraic methods in graph theory, pp.317-343, 1978. ,
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph, Algorithmica, vol.9, issue.1-6, pp.583-596, 1992. ,
DOI : 10.1007/BF01758778
Kuratowski's theorem, Journal of Graph Theory, vol.21, issue.3, pp.225-241, 1981. ,
DOI : 10.1002/jgt.3190050304
Reflections on graph theory, Journal of Graph Theory, vol.57, issue.3, pp.309-324, 2006. ,
DOI : 10.1002/jgt.3190100308
A constructive description of some classes of graphs, 1975. ,
A theory of 3-connected graphs, Indagationes Mathematicae (Proceedings), vol.64, pp.441-455, 1961. ,
DOI : 10.1016/S1385-7258(61)50045-5
Connectivity in graphs, Mathematical Expositions, 1966. ,
Finding triconnected components of graphs. Linear and Multilinear Algebra, pp.143-165, 1983. ,
Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs. Linear and Multilinear Algebra, pp.119-141, 1983. ,
Introduction to Graph Theory, 2001. ,