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