On the public citation graph

Intersection Dimensions of Graph Classes

https://doi.org/10.1007/bf02986660
0 signed · 21 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01788656openalex-snapshot
On dimensional properties of graphs
inferredcites →https://doi.org/10.1007/bf02565753openalex-snapshot
Partitionstheoreme für Graphen
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/0012-365x(91)90069-eopenalex-snapshot
On grid intersection graphs
inferredcites →https://doi.org/10.1016/0012-365x(93)90354-vopenalex-snapshot
Grid intersection graphs and boxicity
inferredcites →https://doi.org/10.1016/0095-8956(86)90061-4openalex-snapshot
Interval representations of planar 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/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect 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-031-15914-5_18openalex-snapshot
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
inferred← citeshttps://doi.org/10.1007/978-3-031-91357-0_3openalex-snapshot
On Variants of PCGs: A Survey of Current Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_17openalex-snapshot
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
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.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.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.