On the public citation graph

Systems of Circuits on Two-Dimensional Manifolds

https://doi.org/10.2307/1968030
0 signed · 72 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470067949.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/jgt.3190020402openalex-snapshot
The embeddings of a graph—A survey
inferred← citeshttps://doi.org/10.1002/jgt.3190100310openalex-snapshot
From topology to algebra
inferred← citeshttps://doi.org/10.1006/aima.1996.0069openalex-snapshot
The Crossing Number of a Graph on a Compact 2-Manifold
inferred← citeshttps://doi.org/10.1006/jctb.1995.1053openalex-snapshot
On the Spectral Radius and the Genus of Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1997.1810openalex-snapshot
A Nebeský-Type Characterization for Relative Maximum Genus
inferred← citeshttps://doi.org/10.1007/978-1-4419-6053-5_22openalex-snapshot
Topology
inferred← citeshttps://doi.org/10.1007/978-3-031-07442-4_4openalex-snapshot
Topology
inferred← citeshttps://doi.org/10.1007/978-3-031-56105-4_4openalex-snapshot
Topologie
inferred← citeshttps://doi.org/10.1007/978-3-032-02326-1_15openalex-snapshot
Graph Structure of the Nodal Set and Bounds on the Number of Critical Points of Eigenfunctions on Riemannian Manifolds
inferred← citeshttps://doi.org/10.1007/978-3-319-05957-0_8openalex-snapshot
Topological Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-34364-3_1openalex-snapshot
The Classification Theorem: Informal Presentation
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_6openalex-snapshot
The Complexity of the Graph Embedding Problem
inferred← citeshttps://doi.org/10.1007/bf02086611openalex-snapshot
Drawings of Graphs on Surfaces with Few Crossings
inferred← citeshttps://doi.org/10.1007/jhep09(2014)023openalex-snapshot
Two-dimensional Yang-Mills theory on recursive infinite genus surfaces
inferred← citeshttps://doi.org/10.1007/s00208-004-0594-2openalex-snapshot
Many triangulated 3-spheres
inferred← citeshttps://doi.org/10.1007/s00373-010-0928-7openalex-snapshot
Drawing Disconnected Graphs on the Klein Bottle
inferred← citeshttps://doi.org/10.1007/s00454-004-1150-2openalex-snapshot
Optimal System of Loops on an Orientable Surface
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90170-2openalex-snapshot
An obstruction to embedding graphs in surfaces
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00215-iopenalex-snapshot
The genus of a random graph
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90036-jopenalex-snapshot
Decomposition of graphs on surfaces and a homotopic circulation theorem
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90064-5openalex-snapshot
Densely embedded graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-158860-1.50045-9openalex-snapshot
A SHORT LIST OF PROBLEMS
inferred← citeshttps://doi.org/10.1016/b978-044482375-5/50007-9openalex-snapshot
The Topological Work of Henri Poincaré
inferred← citeshttps://doi.org/10.1016/j.cag.2023.03.005openalex-snapshot
Towards a robust and portable pipeline for quad meshing: Topological initialization of injective integer grid maps
inferred← citeshttps://doi.org/10.1016/j.cma.2023.116445openalex-snapshot
The quad layout immersion: A mathematically equivalent representation of a surface quadrilateral layout
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.004openalex-snapshot
Local certification of graphs with bounded genus
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.012openalex-snapshot
Characterizing circle graphs with binomial partial Petrial polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.019openalex-snapshot
Notes on a theorem of Naji
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.02.004openalex-snapshot
Binary nullity, Euler circuits and interlace polynomials
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.016openalex-snapshot
The transition matroid of a 4-regular graph: An introduction
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.11.002openalex-snapshot
Space complexity of perfect matching in bounded genus bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.09.006openalex-snapshot
On the interlace polynomials
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.09.003openalex-snapshot
Excluding a planar matching minor in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2011.06.048openalex-snapshot
On the linear algebra of local complementation
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.012openalex-snapshot
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.018openalex-snapshot
Using bigraphs to model topological graphs embedded in orientable surfaces
inferred← citeshttps://doi.org/10.1016/j.topol.2020.107558openalex-snapshot
An elementary proof of Euler's formula using Cauchy's method
inferred← citeshttps://doi.org/10.1016/s0195-6698(87)80022-7openalex-snapshot
On The Product of Certain Permutations
inferred← citeshttps://doi.org/10.1017/s0017089500006996openalex-snapshot
Flows on hypermaps
inferred← citeshttps://doi.org/10.1021/ci049865copenalex-snapshot
Oriented 2-Cell Embeddings of a Graph and Their Symmetry Classification: Generating Algorithms and Case Study of the Möbius-Kantor Graph
inferred← citeshttps://doi.org/10.1090/s0002-9904-1946-08592-4openalex-snapshot
Section II: Nonserial publications
inferred← citeshttps://doi.org/10.1090/s0002-9939-1958-0104219-4openalex-snapshot
Classification of Finite 2-Complexes
inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0143186-0openalex-snapshot
On the Classification of Noncompact Surfaces
inferred← citeshttps://doi.org/10.1103/physrevd.93.085018openalex-snapshot
Genus dependence of the number of (non-)orientable surface triangulations
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181986openalex-snapshot
Optimal system of loops on an orientable surface
inferred← citeshttps://doi.org/10.1109/smi.2002.1003545openalex-snapshot
A control of smooth deformations with topological change on a polyhedral mesh based on curves and loops
inferred← citeshttps://doi.org/10.1142/s0218216511008875openalex-snapshot
A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
inferred← citeshttps://doi.org/10.1142/s0218216511009157openalex-snapshot
A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS
inferred← citeshttps://doi.org/10.1145/1250790.1250848openalex-snapshot
Computing crossing number in linear time
inferred← citeshttps://doi.org/10.1145/1374376.1374443openalex-snapshot
Graph and map isomorphism and all polyhedral embeddings in linear time
inferred← citeshttps://doi.org/10.1145/378583.378630openalex-snapshot
Computing a canonical polygonal schema of an orientable triangulated surface
inferred← citeshttps://doi.org/10.1145/98524.98546openalex-snapshot
Computational complexity of combinatorial surfaces
inferred← citeshttps://doi.org/10.11575/cdm.v9i1.62166openalex-snapshot
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
inferred← citeshttps://doi.org/10.1201/9781584888215-c3openalex-snapshot
Computational Topology
inferred← citeshttps://doi.org/10.20382/jocg.v7i1a4openalex-snapshot
2-manifold recognition is in logspace
inferred← citeshttps://doi.org/10.21711/26755254/rmu20214openalex-snapshot
MODELOS DO PLANO PROJETIVO NO ESPAÇO TRIDIMENSIONAL
inferred← citeshttps://doi.org/10.2307/3029520openalex-snapshot
Combinatorial Topology of Surfaces
inferred← citeshttps://doi.org/10.37236/2911openalex-snapshot
The Adjacency Matroid of a Graph
inferred← citeshttps://doi.org/10.37236/5223openalex-snapshot
Isotropic Matroids II: Circle Graphs
inferred← citeshttps://doi.org/10.4153/cmb-1961-003-1openalex-snapshot
A Note on the Construction of a Set of Fundamental Circuits on a Surface of Genus p
inferred← citeshttps://doi.org/10.48550/arxiv.0804.2911openalex-snapshot
Locally Metric Spacetimes
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1246openalex-snapshot
On the linear algebra of local complementation
inferred← citeshttps://doi.org/10.48550/arxiv.1107.5493openalex-snapshot
The adjacency matroid of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0482openalex-snapshot
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1307.8097openalex-snapshot
The transition matroid of a 4-regular graph: an introduction
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04299openalex-snapshot
Isotropic matroids II: Circle graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.03386openalex-snapshot
Topology and Routing Problems: The Circular Frame
inferred← citeshttps://doi.org/10.70675/501753aazc972z4693z856cz4959181e256copenalex-snapshot
Self-Assembly on Various Surfaces
inferred← citeshttps://doi.org/10.70675/60acf3c6ze5e5z4b87z8adbz9260590110ceopenalex-snapshot
Layout problems under topological constraints for computational fabrication
inferred← citeshttps://doi.org/10.70675/d7c017a6z23f1z405ez918fze3fd6d43dc3aopenalex-snapshot
Combinatorial theory of the Kontsevich–Zorich cocycle
inferred← citeshttps://doi.org/10.7151/dmgt.1894openalex-snapshot
Splitting cubic circle 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.