The following pages link to (Q5589866):
Displaying 42 items.
- A Mihalisin-Klee theorem for fans (Q306503) (← links)
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- Deformations of plane graphs (Q595673) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- An n log n algorithm for determining the congruity of polyhedra (Q798003) (← links)
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane (Q804583) (← links)
- Graphs of polyhedra; polyhedra as graphs (Q864132) (← links)
- Edge reductions in cyclically \(k\)-connected cubic graphs (Q922553) (← links)
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs (Q1025937) (← links)
- All triangulations of the projective plane are geometrically realizable in \(E^ 4\). (Q1050624) (← links)
- Minimally 3-connected graphs (Q1080868) (← links)
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs (Q1088683) (← links)
- Two ``simple'' 3-spheres (Q1100212) (← links)
- Planarity and duality of finite and infinite graphs (Q1142781) (← links)
- The rigidity of graphs. II (Q1142791) (← links)
- A construction of 3-connected graphs (Q1327517) (← links)
- The structure of quasi 4-connected graphs (Q1356425) (← links)
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. (Q1405103) (← links)
- Generating \(r\)-regular graphs (Q1406030) (← links)
- Contractible circuits in \(3\)-connected graphs (Q1584289) (← links)
- How to describe or design a polyhedron (Q1842764) (← links)
- The 24 symmetry pairings of self-dual maps on the sphere (Q1893173) (← links)
- Generating the centrally symmetric 3-polyhedral graphs (Q1915141) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Dualizing distance-hereditary graphs (Q2214323) (← links)
- Partial matroid representations (Q2266019) (← links)
- Contractible edges and removable edges in 3-connected graphs (Q2287731) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- Counting \(K_4\)-subdivisions (Q2515581) (← links)
- Some analogues of Eberhard's theorem on convex polytopes (Q2532781) (← links)
- Lattice characterization of convex 3-polytopes and of polygonizations of 2-manifolds (Q2539176) (← links)
- Polyhedral realization in \(R^ 3\) of triangulations of the torus and 2- manifolds in cyclic 4-polytopes (Q2551991) (← links)
- Shortness exponents of families of graphs (Q2561232) (← links)
- Generating projective plane polyhedral maps (Q2641311) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
- The Rigidity of Graphs (Q4173376) (← links)
- Strongly involutive self-dual polyhedra (Q5156014) (← links)
- Polytopes, graphs, and complexes (Q5612292) (← links)
- Uniformly 3‐connected graphs (Q6144917) (← links)
