On the public citation graph
On dimensional properties of graphs
0 signed · 42 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/jgt.3190040207openalex-snapshot
An upper bound for the path number of a graph
inferredcites →https://doi.org/10.1002/net.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1016/0012-365x(79)90137-7openalex-snapshot
A characterization of robert's inequality for boxicity
inferredcites →https://doi.org/10.1016/0012-365x(79)90149-3openalex-snapshot
The circular dimension of a graph
inferredcites →https://doi.org/10.1016/0012-365x(90)90290-xopenalex-snapshot
A note on circular dimension
inferredcites →https://doi.org/10.1016/0022-2496(87)90014-9openalex-snapshot
Multidimensional scaling and threshold graphs
inferredcites →https://doi.org/10.1016/0095-8956(83)90057-6openalex-snapshot
On the sphericity and cubicity of graphs
inferredcites →https://doi.org/10.1016/0095-8956(86)90081-xopenalex-snapshot
Sphericity exceeds cubicity for almost all complete bipartite graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90077-xopenalex-snapshot
Computing the boxicity of a graph by covering its complement by cointerval graphs
inferredcites →https://doi.org/10.1016/0166-218x(85)90061-7openalex-snapshot
Applications of edge coverings by cliques
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/1385-7258(77)90055-5openalex-snapshot
Contentment in graph theory: Covering graphs with cliques
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12628-3openalex-snapshot
Characterizing circular-arc graphs
inferredcites →https://doi.org/10.1137/0213005openalex-snapshot
Clique Covering of Graphs IV. Algorithms
inferredcites →https://doi.org/10.1137/1.9781611970401openalex-snapshot
Graph Theory and Its Applications to Problems of Society
inferredcites →https://doi.org/10.2307/2322080openalex-snapshot
Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems.
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
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.3190150302openalex-snapshot
The threshold weight of a graph
inferred← citeshttps://doi.org/10.1006/jmps.1998.1226openalex-snapshot
A Generic Disjunctive/Conjunctive Decomposition Model forn-ary Relations
inferred← citeshttps://doi.org/10.1007/bf02986660openalex-snapshot
Intersection Dimensions of Graph Classes
inferred← citeshttps://doi.org/10.1007/bfb0021820openalex-snapshot
Grid intersection and box intersection graphs on surfaces
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90023-qopenalex-snapshot
Dimensions of hypergraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90038-xopenalex-snapshot
The relationship between the threshold dimension of split graphs and various dimensional parameters
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90232-dopenalex-snapshot
Subtree and substar intersection numbers
inferred← citeshttps://doi.org/10.1016/b978-0-12-801213-0.00001-0openalex-snapshot
Graph Theory for Systems Biology
inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.035openalex-snapshot
Ferrers dimension of grid intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.010openalex-snapshot
Intersection of chordal graphs and some related partition problems
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.011openalex-snapshot
An upper bound for Cubicity in terms of Boxicity
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.058openalex-snapshot
Intersection Dimension and Maximum Degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.061openalex-snapshot
Constructing independent spanning trees for locally twisted cubes
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70373-xopenalex-snapshot
New Directions in Graph Theory (With an Emphasis on the Role of Applications)
inferred← citeshttps://doi.org/10.1145/225058.225283openalex-snapshot
Recognition of graphs with threshold dimension two
inferred← citeshttps://doi.org/10.37236/9110openalex-snapshot
Representing Graphs as the Intersection of Cographs and Threshold Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2173openalex-snapshot
Intersection dimension and graph invariants
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.