On the public citation graph
On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
0 signed · 95 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mana.19670350503openalex-snapshot
Zusammenzüge und Unterteilungen von Graphen
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1016/s0021-9800(70)80071-0openalex-snapshot
Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected graphs
inferredcites →https://doi.org/10.1112/plms/s3-20.1.144openalex-snapshot
On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
inferredcites →https://doi.org/10.2307/2313923openalex-snapshot
A Proof of 4-Coloring the Edges of a Cubic Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20157openalex-snapshot
A characterization of weakly four‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.22026openalex-snapshot
On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190050307openalex-snapshot
A new planarity criterion for 3‐connected graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190140410openalex-snapshot
Removable edges in 3‐connected graphs
inferred← citeshttps://doi.org/10.1007/3-540-46648-7_35openalex-snapshot
Triangle-Free Planar Graphs as Segments Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-0-8176-8364-1_3openalex-snapshot
Groups, Actions, and Symmetry
inferred← citeshttps://doi.org/10.1007/978-0-8176-8364-1_5openalex-snapshot
Combinatorial Configurations
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_15openalex-snapshot
Reaching 3-Connectivity via Edge-Edge Additions
inferred← citeshttps://doi.org/10.1007/978-3-031-83864-4_5openalex-snapshot
Characterizing Minimally 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_66openalex-snapshot
Certifying 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_67openalex-snapshot
A Planarity Test via Construction Sequences
inferred← citeshttps://doi.org/10.1007/bf01258299openalex-snapshot
How to describe or design a polyhedron
inferred← citeshttps://doi.org/10.1007/bf01405094openalex-snapshot
Rigidity and the lower bound theorem 1
inferred← citeshttps://doi.org/10.1007/bf01858449openalex-snapshot
Generating the centrally symmetric 3-polyhedral graphs
inferred← citeshttps://doi.org/10.1007/bf02763173openalex-snapshot
All triangulations of the projective plane are geometrically realizable inE 4
inferred← citeshttps://doi.org/10.1007/bf02771220openalex-snapshot
Some analogues of eberhard’s theorem on convex polytopes
inferred← citeshttps://doi.org/10.1007/bf02771551openalex-snapshot
Lattice characterization of convex 3-polytopes and of polygonizations of 2-manifolds
inferred← citeshttps://doi.org/10.1007/bf02773688openalex-snapshot
A construction of 3-connected graphs
inferred← citeshttps://doi.org/10.1007/bfb0060111openalex-snapshot
Incidence patterns of graphs and complexes
inferred← citeshttps://doi.org/10.1007/s00373-014-1431-3openalex-snapshot
Contractible and Removable Edges in 3-Connected Infinite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02103-5openalex-snapshot
Contractible Edges and Removable Edges in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02526-7openalex-snapshot
A Constructive Characterization of 4-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9450-9openalex-snapshot
Construction Sequences and Certifying 3-connectivity
inferred← citeshttps://doi.org/10.1007/s00453-011-9570-xopenalex-snapshot
Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
inferred← citeshttps://doi.org/10.1007/s00453-014-9922-4openalex-snapshot
Regular Augmentation of Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00454-023-00537-6openalex-snapshot
Adjacency Graphs of Polyhedral Surfaces
inferred← citeshttps://doi.org/10.1007/s101070050039openalex-snapshot
How to make a graph four-connected
inferred← citeshttps://doi.org/10.1016/0012-365x(71)90011-2openalex-snapshot
Polyhedral realization in R3 of triangulations of the torus and 2-manifolds in cyclic 4-polytopes
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90236-6openalex-snapshot
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90159-fopenalex-snapshot
Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00229-popenalex-snapshot
The structure of quasi 4-connected graphs
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90011-4openalex-snapshot
An n log n algorithm for determining the congruity of polyhedra
inferred← citeshttps://doi.org/10.1016/0022-247x(79)90108-2openalex-snapshot
The rigidity of graphs, II
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90083-0openalex-snapshot
Planarity and duality of finite and infinite graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(83)90038-2openalex-snapshot
Deformations of plane graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90057-1openalex-snapshot
A refinement of Kuratowski's theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(86)90074-2openalex-snapshot
Minimally 3-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90043-jopenalex-snapshot
Generating projective plane polyhedral maps
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90004-hopenalex-snapshot
Edge reductions in cyclically k-connected cubic graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(73)90012-5openalex-snapshot
Shortness exponents of families of graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.dam.2014.11.015openalex-snapshot
The minimum number of minimal codewords in an [n,k] -code and in graphic codes
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.037openalex-snapshot
Graphs of polyhedra; polyhedra as graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.047openalex-snapshot
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00243-4openalex-snapshot
Contractible circuits in 3-connected graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00037-0openalex-snapshot
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00593-0openalex-snapshot
Generating r-regular graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80041-4openalex-snapshot
Partial Matroid Representations
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73499-6openalex-snapshot
Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80119-6openalex-snapshot
Machine interpretation of line drawings
inferred← citeshttps://doi.org/10.1017/s0963548305007340openalex-snapshot
Splitter Theorems for Cubic Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0511410-9openalex-snapshot
The Rigidity of Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0927685-4openalex-snapshot
Infinitesimally Rigid Polyhedra. II: Modified Spherical Frameworks
inferred← citeshttps://doi.org/10.1109/coase.2017.8256076openalex-snapshot
On the separation of a polyhedron from its single-part mold
inferred← citeshttps://doi.org/10.1109/tnet.2014.2345099openalex-snapshot
Survivable Mapping of Virtual Topologies for Double-Node Failure
inferred← citeshttps://doi.org/10.1142/9789812796608_0002openalex-snapshot
Triangle-Free Planar Graphs as Segment Intersection Graphs
inferred← citeshttps://doi.org/10.1215/ijm/1498032033openalex-snapshot
Tutte relations, TQFT, and planarity of cubic graphs
inferred← citeshttps://doi.org/10.25911/5d626e1abd90eopenalex-snapshot
Recursive Algorithms for Generation of Planar Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2194.eabopenalex-snapshot
Strongly involutive self-dual polyhedra
inferred← citeshttps://doi.org/10.3390/a14010009openalex-snapshot
Constructing Minimally 3-Connected Graphs
inferred← citeshttps://doi.org/10.3990/1.9789036528924openalex-snapshot
Removable edges in 4-connected graphs
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.126openalex-snapshot
Optimal Morphs of Convex Drawings
inferred← citeshttps://doi.org/10.4310/jdg/1214447220openalex-snapshot
Detecting unknotted graphs in 3-space
inferred← citeshttps://doi.org/10.4310/joc.2013.v4.n1.a5openalex-snapshot
A note on spanning trees and totally cyclic orientations of 3-connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1011.6187openalex-snapshot
Contractions, Removals and How to Certify 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.math/9907050openalex-snapshot
On some extremal problems in graph theory
inferred← citeshttps://doi.org/10.5614/ejgta.2014.2.1.2openalex-snapshot
On maximum cycle packings in polyhedral graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2192openalex-snapshot
Dualizing distance-hereditary graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00043openalex-snapshot
Triangle-Free Planar Graphs and Segment Intersection Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.