On the public citation graph
On a spatial analogue of Kuratowski's theorem on planar graphs — An open problem
0 signed · 50 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.10114openalex-snapshot
A newly recognized intrinsically knotted graph
inferred← citeshttps://doi.org/10.1002/jgt.21812openalex-snapshot
Finding Minors in Graphs with a Given Path Structure
inferred← citeshttps://doi.org/10.1002/jgt.22703openalex-snapshot
On the number of edges in maximally linkless graphs
inferred← citeshttps://doi.org/10.1002/jgt.22705openalex-snapshot
Edge‐maximal graphs on orientable and some nonorientable surfaces
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/s00454-023-00494-0openalex-snapshot
Tutte Embeddings of Tetrahedral Meshes
inferred← citeshttps://doi.org/10.1007/s00493-018-3733-1openalex-snapshot
Defective Colouring of Graphs Excluding A Subgraph or Minor
inferred← citeshttps://doi.org/10.1016/0166-8641(90)90053-5openalex-snapshot
Knots in spatial embeddings of the complete graph on four vertices
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.09.007openalex-snapshot
Reversing a polyhedral surface by origami-deformation
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.02.001openalex-snapshot
The extremal function for Petersen minors
inferred← citeshttps://doi.org/10.1017/cbo9780511721335.008openalex-snapshot
Recent Excluded Minor Theorems for Graphs
inferred← citeshttps://doi.org/10.1080/07468342.1989.11973232openalex-snapshot
Are Graphs Finally Surfacing?
inferred← citeshttps://doi.org/10.1090/conm/689/13845openalex-snapshot
Recent developments in spatial graph theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-1069741-9openalex-snapshot
Ramsey Theorems for Knots, Links and Spatial Graphs
inferred← citeshttps://doi.org/10.1090/s0273-0979-1993-00335-5openalex-snapshot
Linkless embeddings of graphs in 3-space
inferred← citeshttps://doi.org/10.1142/s0218216504003652openalex-snapshot
SOME NEW INTRINSICALLY 3-LINKED GRAPHS
inferred← citeshttps://doi.org/10.1142/s0218216514200016openalex-snapshot
Linear embeddings of K9 are triple linked
inferred← citeshttps://doi.org/10.1142/s0218216515500418openalex-snapshot
On the number of links in a linearly embedded K3,3,1
inferred← citeshttps://doi.org/10.1142/s0218216517400119openalex-snapshot
Intrinsic 3-linkedness is not preserved by Y∇ moves
inferred← citeshttps://doi.org/10.1142/s0218216521410042openalex-snapshot
Topological symmetry groups of the Petersen graph
inferred← citeshttps://doi.org/10.18910/57687openalex-snapshot
KNOTTING AND LINKING IN THE PETERSEN FAMILY
inferred← citeshttps://doi.org/10.2140/agt.2006.6.1025openalex-snapshot
Intrinsic linking and knotting of graphs in arbitrary 3–manifolds
inferred← citeshttps://doi.org/10.2140/agt.2013.13.1579openalex-snapshot
Some Ramsey-type results on intrinsic linking ofn–complexes
inferred← citeshttps://doi.org/10.2140/agt.2025.25.4585openalex-snapshot
Linear linkless embeddings: proof of a conjecture by Sachs
inferred← citeshttps://doi.org/10.2140/involve.2008.1.145openalex-snapshot
On graphs for which every planar immersion lifts to a knotted spatial embedding
inferred← citeshttps://doi.org/10.2140/involve.2017.10.1openalex-snapshot
Intrinsically triple-linked graphs in ℝP3
inferred← citeshttps://doi.org/10.2140/pjm.2000.194.465openalex-snapshot
Higher dimensional links in a simplicial complex embedded in a sphere
inferred← citeshttps://doi.org/10.2140/pjm.2001.200.191openalex-snapshot
Vassiliev invariants of knots in a spatial graph
inferred← citeshttps://doi.org/10.26493/1855-3974.1427.75copenalex-snapshot
Intrinsic linking with linking numbers of specified divisibility
inferred← citeshttps://doi.org/10.37236/10322openalex-snapshot
Weakly Linked Embeddings of Pairs of Complete Graphs in $\mathbb{R}^3$
inferred← citeshttps://doi.org/10.37236/7406openalex-snapshot
Defective and Clustered Graph Colouring
inferred← citeshttps://doi.org/10.4064/fm201-2-3openalex-snapshot
Intrinsic linking and knotting are arbitrarily complex
inferred← citeshttps://doi.org/10.4153/s0008414x21000316openalex-snapshot
Tree densities in sparse graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3368openalex-snapshot
Generalizing the Converse to Pascal's Theorem via Hyperplane Arrangements and the Cayley-Bacharach Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1613openalex-snapshot
Linear embeddings of $K_9$ are triple linked
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0572openalex-snapshot
On the number of links in a linearly embedded $K_{3,3,1}$
inferred← citeshttps://doi.org/10.48550/arxiv.1410.1971openalex-snapshot
Intrinsic 3-linkedness is Not Preserved by $\text{Y}\nabla$ moves
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07342openalex-snapshot
On intrinsically knotted and linked graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08953openalex-snapshot
Intrinsically spherical 3-linked graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0610501openalex-snapshot
Intrinsic linking and knotting are arbitrarily complex
inferred← citeshttps://doi.org/10.70675/e9de8f94zbf4dz4dacza8bfz2a4977c31129openalex-snapshot
Trees, Decompositions, and Knot theory
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.