On the public citation graph
Incidence patterns of graphs and complexes
0 signed · 69 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/j.1538-7305.1968.tb00075.xopenalex-snapshot
On a Class of Configuration and Coincidence Problems
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/bf01904834openalex-snapshot
The interchange graph of a finite graph
inferredcites →https://doi.org/10.1007/bf02886939openalex-snapshot
Osservazioni sulle caratteristiche dei grafi o singrammi
inferredcites →https://doi.org/10.1007/bfb0060102openalex-snapshot
On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
inferredcites →https://doi.org/10.1016/0016-0032(61)90712-8openalex-snapshot
Linear graphs and electrical networks
inferredcites →https://doi.org/10.1016/0095-8956(71)90051-7openalex-snapshot
A characterization of a class of regular graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80068-1openalex-snapshot
Characterization of line graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80104-2openalex-snapshot
A characterization of tetrahedral graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80105-4openalex-snapshot
A characterization of cubic lattice graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80055-9openalex-snapshot
A partial characterization of clique graphs
inferredcites →https://doi.org/10.1016/s0021-9800(69)80104-3openalex-snapshot
A characterization problem in graph theory
inferredcites →https://doi.org/10.1016/s0031-8914(63)80241-4openalex-snapshot
A soluble self-avoiding walk problem
inferredcites →https://doi.org/10.1017/s0013091500011421openalex-snapshot
Total Graphs and Traversability
inferredcites →https://doi.org/10.1017/s0305004100041657openalex-snapshot
A criterion for the planarity of the total graph of a graph
inferredcites →https://doi.org/10.1038/scientificamerican0162-70openalex-snapshot
The fine structure of the gene.
inferredcites →https://doi.org/10.1073/pnas.45.11.1607openalex-snapshot
ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
inferredcites →https://doi.org/10.1090/pspum/007/0154183openalex-snapshot
Borsuk’s problem and related questions
inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot
Helly’s theorem and its relatives
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11160-5openalex-snapshot
Incidence matrices with the consecutive 1’s property
inferredcites →https://doi.org/10.1090/s0002-9904-1965-11389-1openalex-snapshot
The existence of complete cycles in repeated line-graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0190032-2openalex-snapshot
On the line graph of a projective plane
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0184871-6openalex-snapshot
On the line graph of a symmetric balanced incomplete block design
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0231740-1openalex-snapshot
On Hamiltonian Line-Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-42.1.226openalex-snapshot
The Colour Numbers of Complete Graphs
inferredcites →https://doi.org/10.1147/rd.45.0487openalex-snapshot
On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
inferredcites →https://doi.org/10.1177/0008068319670207openalex-snapshot
Tactical Configurations and Graph Theory
inferredcites →https://doi.org/10.1214/aoms/1177703593openalex-snapshot
On the Line Graph of the Complete Bipartite Graph
inferredcites →https://doi.org/10.1214/aoms/1177704179openalex-snapshot
On the Line-Graph of the Complete Bigraph
inferredcites →https://doi.org/10.1214/aoms/1177705914openalex-snapshot
On the Uniqueness of the Triangular Association Scheme
inferredcites →https://doi.org/10.1214/aoms/1177706207openalex-snapshot
The Uniqueness of the $\mathrm{L}_2$ Association Scheme
inferredcites →https://doi.org/10.1214/aoms/1177706357openalex-snapshot
On a Characterization of the Triangular Association Scheme
inferredcites →https://doi.org/10.1214/aoms/1177706724openalex-snapshot
The Uniqueness of the Triangular Association Scheme
inferredcites →https://doi.org/10.21136/cpm.1957.117236openalex-snapshot
From the theory of regular graphs of third and fourth degree
inferredcites →https://doi.org/10.2140/pjm.1963.13.389openalex-snapshot
Strongly regular graphs, partial geometries and partially balanced designs
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
inferredcites →https://doi.org/10.4153/cjm-1964-055-5openalex-snapshot
A Characterization of Comparability Graphs and of Interval Graphs
inferredcites →https://doi.org/10.4153/cjm-1965-069-6openalex-snapshot
On the line Graph of a Finite Affine Plane
inferredcites →https://doi.org/10.4153/cjm-1966-014-3openalex-snapshot
The Representation of a Graph by Set Intersections
inferredcites →https://doi.org/10.4153/cmb-1963-001-xopenalex-snapshot
A Characterization of Block-Graphs
inferredcites →https://doi.org/10.4153/cmb-1965-002-7openalex-snapshot
The Isomorphism between Graphs and their Adjoint Graphs
inferredcites →https://doi.org/10.4153/cmb-1965-051-3openalex-snapshot
On Eulerian and Hamiltonian Graphs and Line Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferred← citeshttps://doi.org/10.1007/bf01229745openalex-snapshot
d-Collapsing and nerves of families of convex sets
inferred← citeshttps://doi.org/10.1007/bfb0066177openalex-snapshot
Graphe representatif de l’hypergraphe h-parti complet
inferred← citeshttps://doi.org/10.1007/s00200-020-00440-0openalex-snapshot
Colouring simplicial complexes via the Lechuga–Murillo’s model
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90075-7openalex-snapshot
Further characterizations of cubic lattice graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90150-2openalex-snapshot
Two characterizations of interchange graphs of complete m-partite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.013openalex-snapshot
Strong resolving graphs: The realization and the characterization problems
inferred← citeshttps://doi.org/10.1016/j.disc.2004.09.006openalex-snapshot
Isomorphisms of Pk -graphs for k⩾4
inferred← citeshttps://doi.org/10.1090/s0002-9939-1981-0620016-8openalex-snapshot
Characterization of (𝑟,𝑠)-adjacency graphs 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.