On the public citation graph
The theory of left-right paths
0 signed · 59 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/andp.18471481202openalex-snapshot
Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
inferredcites →https://doi.org/10.1007/978-3-642-87424-6openalex-snapshot
Mathematical Foundations of Network Analysis
inferredcites →https://doi.org/10.1007/bf01691465openalex-snapshot
Graph property recognition machines
inferredcites →https://doi.org/10.1137/0120042openalex-snapshot
The Decomposition of a Graph and the Introduction of a New Class of Subgraphs
inferredcites →https://doi.org/10.1137/0120054openalex-snapshot
On Vector Spaces Associated with a Graph
inferredcites →https://doi.org/10.1137/0130017openalex-snapshot
Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199603)21:3<301::aid-jgt4>3.0.co;2-uopenalex-snapshot
Walks through every edge exactly twice II
inferred← citeshttps://doi.org/10.1002/jgt.3190030312openalex-snapshot
Full 4‐colorings of 4‐regular maps
inferred← citeshttps://doi.org/10.1002/jgt.3190180710openalex-snapshot
Walks through every edge exactly twice
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_65openalex-snapshot
A short proof of a Gauss problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0163-9_17openalex-snapshot
Knots and Eulerian Cycles
inferred← citeshttps://doi.org/10.1007/978-81-322-2449-5_1openalex-snapshot
Introduction: Main $$ZC$$ -Notions
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_12openalex-snapshot
On Transition Polynomials of 4-Regular Graphs
inferred← citeshttps://doi.org/10.1007/bf01836154openalex-snapshot
The Gauss code problem off the plane
inferred← citeshttps://doi.org/10.1007/pl00009461openalex-snapshot
On a Characterization of Gauss Codes
inferred← citeshttps://doi.org/10.1007/s00037-009-0266-4openalex-snapshot
Space-Efficient Counting in Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s002080050030openalex-snapshot
The Penrose polynomial of a plane graph
inferred← citeshttps://doi.org/10.1007/s00454-017-9954-zopenalex-snapshot
Zigzag Structure of Thin Chamber Complexes
inferred← citeshttps://doi.org/10.1007/s00454-024-00631-3openalex-snapshot
Zigzags in Combinatorial Tetrahedral Chains and the Associated Markov Chain
inferred← citeshttps://doi.org/10.1007/s10255-021-1020-1openalex-snapshot
The Number of Circles of a Maximum State of a Plane Graph with Applications
inferred← citeshttps://doi.org/10.1007/s10801-013-0445-xopenalex-snapshot
Critical groups of graphs with reflective symmetry
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90048-1openalex-snapshot
Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths
inferred← citeshttps://doi.org/10.1016/0012-365x(81)90255-7openalex-snapshot
Local complementation and interlacement graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90050-3openalex-snapshot
Remarkable valuation of the dichromatic polynomial of planar multigraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90079-2openalex-snapshot
On the evaluation at (3, 3) of the Tutte polynomial of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90083-4openalex-snapshot
On Tutte polynomials and cycles of plane graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90065-6openalex-snapshot
The construction and classification of self-dual spherical polyhedra
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.028openalex-snapshot
On plane graphs with link component number equal to the nullity
inferred← citeshttps://doi.org/10.1016/j.disc.2003.09.011openalex-snapshot
Straight-ahead walks in Eulerian graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112405openalex-snapshot
Z -knotted and Z -homogeneous triangulations of surfaces
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.06.002openalex-snapshot
Bicycles and left–right tours in locally finite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.08.007openalex-snapshot
A homological solution for the Gauss code problem in arbitrary surfaces
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00100-5openalex-snapshot
A polynomial time algorithm for determining zero Euler–Petrie genus of an Eulerian graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70465-5openalex-snapshot
On Edge-Colorings of Cubic Graphs and a Formula of Roger Penrose
inferred← citeshttps://doi.org/10.1016/s0195-6698(83)80028-6openalex-snapshot
Graphes de Cordes et Espaces Graphiques
inferred← citeshttps://doi.org/10.1017/s0960129522000238openalex-snapshot
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs
inferred← citeshttps://doi.org/10.1017/s0963548304006583openalex-snapshot
Zigzag Structures of Simple Two-Faced Polyhedra
inferred← citeshttps://doi.org/10.1021/ci0200669openalex-snapshot
Version of Zones and Zigzag Structure in Icosahedral Fullerenes and Icosadeltahedra
inferred← citeshttps://doi.org/10.1021/ci049955hopenalex-snapshot
Zigzags, Railroads, and Knots in Fullerenes
inferred← citeshttps://doi.org/10.1080/00029890.1987.12000694openalex-snapshot
Trees and Euler Tours in a Planar Graph and Its Relatives
inferred← citeshttps://doi.org/10.1142/9789812705808_0006openalex-snapshot
4-valent plane graphs with 2-, 3- and 4-gonal faces
inferred← citeshttps://doi.org/10.1142/s0218216511009765openalex-snapshot
DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES
inferred← citeshttps://doi.org/10.1142/s0218216516410054openalex-snapshot
Determinant of links, spanning trees, and a theorem of Shank
inferred← citeshttps://doi.org/10.1142/s0218216516500334openalex-snapshot
Vertex-colored graphs, bicycle spaces and Mahler measure
inferred← citeshttps://doi.org/10.11650/twjm/1500406667openalex-snapshot
ZIGZAG AND CENTRAL CIRCUIT STRUCTURE OF $(\{1,2,3\}, 6)$-SPHERES
inferred← citeshttps://doi.org/10.26493/1855-3974.2242.842openalex-snapshot
Z-oriented triangulations of surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.1007.4706openalex-snapshot
({2,3}, 6)-spheres and their generalizations
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0139openalex-snapshot
When will the crossing number of an alternating link decrease by two via a crossing change?
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05401openalex-snapshot
On the lengths of zigzags in thin complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1902.10788openalex-snapshot
Triangulations with homogeneous zigzags
inferred← citeshttps://doi.org/10.48550/arxiv.math/0301012openalex-snapshot
An Affine Linear Solution for the 2-Face Colorable Gauss Code Problem in the Klein Bottle and a Quadratic System for Arbitrary Closed Surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.math/0301053openalex-snapshot
On Maps with a Single Zigzag
inferred← citeshttps://doi.org/10.48550/arxiv.math/0405279openalex-snapshot
Zigzag structure of complexes
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.