On the public citation graph
Separation Dimension of Bounded Degree Graphs
0 signed · 25 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/rsa.3240010405openalex-snapshot
Linear arboricity of random regular graphs
inferredcites →https://doi.org/10.1006/jcta.1996.0019openalex-snapshot
On the Order Dimension of 1-Sets versusk-Sets
inferredcites →https://doi.org/10.1007/978-1-4757-6048-4_12openalex-snapshot
On the Prague Dimension of Kneser Graphs
inferredcites →https://doi.org/10.1007/bf00403406openalex-snapshot
On the dimensions of ordered sets of bounded degree
inferredcites →https://doi.org/10.1007/pl00007233openalex-snapshot
Linear Arboricity and Linear k-Arboricity of Regular Graphs
inferredcites →https://doi.org/10.1016/0095-8956(92)90023-qopenalex-snapshot
Dimensions of hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9939-1950-0038922-4openalex-snapshot
Concerning a Certain Set of Arrangements
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.48550/arxiv.1212.6756openalex-snapshot
Pairwise Suitable Family of Permutations and Boxicity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21802openalex-snapshot
Perfect and nearly perfect separation dimension of complete and random graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_11openalex-snapshot
Induced Separation Dimension
inferred← citeshttps://doi.org/10.1007/s00453-015-0050-6openalex-snapshot
Separation Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00453-017-0353-xopenalex-snapshot
The Induced Separation Dimension of a Graph
inferred← citeshttps://doi.org/10.1007/s13226-025-00893-4openalex-snapshot
A survey on the boxicity and cubicity of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113085openalex-snapshot
Local boxicity and maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115017openalex-snapshot
Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.09.001openalex-snapshot
Fractional and circular separation dimension of graphs
inferred← citeshttps://doi.org/10.1017/fms.2021.52openalex-snapshot
Zarankiewicz’s problem for semilinear hypergraphs
inferred← citeshttps://doi.org/10.1017/s0305004119000525openalex-snapshot
Separation dimension and degree
inferred← citeshttps://doi.org/10.23638/dmtcs-19-3-8openalex-snapshot
Circular Separation Dimension of a Subclass of Planar 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.