scientific article; zbMATH DE number 3308985

Publication date: 1969

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

A construction of 3-connected graphs, Minimally 3-connected graphs, Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs, A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, A Mihalisin-Klee theorem for fans, The 24 symmetry pairings of self-dual maps on the sphere, The Rigidity of Graphs, Two ``simple 3-spheres, The structure of quasi 4-connected graphs, Generating projective plane polyhedral maps, Graphs of polyhedra; polyhedra as graphs, Polytopes, graphs, and complexes, Deformations of plane graphs, Generating the centrally symmetric 3-polyhedral graphs, Planarity and duality of finite and infinite graphs, The rigidity of graphs. II, Uniformly 3‐connected graphs, A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid., Construction sequences and certifying 3-connectivity, Generating \(r\)-regular graphs, Dualizing distance-hereditary graphs, Edge reductions in cyclically \(k\)-connected cubic graphs, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Facial rainbow edge-coloring of simple 3-connected plane graphs, Strongly involutive self-dual polyhedra, Partial matroid representations, Rigidity and the lower bound theorem. I, Contractible edges and removable edges in 3-connected graphs, Counting \(K_4\)-subdivisions, Regular augmentation of planar graphs, Some analogues of Eberhard's theorem on convex polytopes, Lattice characterization of convex 3-polytopes and of polygonizations of 2-manifolds, Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs, Mondshein Sequences (a.k.a. (2,1)-Orders), Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes, Shortness exponents of families of graphs, How to describe or design a polyhedron, Contractible circuits in \(3\)-connected graphs, All triangulations of the projective plane are geometrically realizable in \(E^ 4\)., An n log n algorithm for determining the congruity of polyhedra, The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes], Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane