On the public citation graph

Dot Product Representations of Planar Graphs

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/978-3-642-18469-7_26openalex-snapshot
Dot Product Representations of Planar Graphs
inferredcites →https://doi.org/10.1007/bf01195002openalex-snapshot
The Colin de Verdi�re number and sphere representations of a graph
inferredcites →https://doi.org/10.1007/bf02187736openalex-snapshot
Embeddings of graphs in euclidean spaces
inferredcites →https://doi.org/10.1016/0012-365x(89)90142-8openalex-snapshot
Geometrical embeddings of graphs
inferredcites →https://doi.org/10.1016/0095-8956(92)90002-fopenalex-snapshot
On embedding of graphs into euclidean spaces of small dimension
inferredcites →https://doi.org/10.1016/s0012-365x(97)00049-6openalex-snapshot
Dot product representations of graphs
inferredcites →https://doi.org/10.1016/s0167-5060(06)x8001-9openalex-snapshot
Threshold Graphs and Related Topics
inferredcites →https://doi.org/10.1090/conm/147/01168openalex-snapshot
On a new graph invariant and a criterion for planarity
inferredcites →https://doi.org/10.1109/sfcs.1984.715908openalex-snapshot
Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1109/sfcs.1985.30openalex-snapshot
Geometrical realization of set systems and probabilistic communication complexity
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph

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-18469-7openalex-snapshot
Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_13openalex-snapshot
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
inferred← citeshttps://doi.org/10.1007/s00373-026-03011-1openalex-snapshot
A Classification of Disconnected Graphs with Exactly One Cycle by Their Dot Product Dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.002openalex-snapshot
Dot product dimension of unicyclic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.022openalex-snapshot
Forbidden induced subgraphs for bounded p -intersection number
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.095openalex-snapshot
What Graphs are 2-Dot Product Graphs?
inferred← citeshttps://doi.org/10.1016/j.socnet.2015.01.001openalex-snapshot
Algorithms for diversity and clustering in social networks through dot product graphs
inferred← citeshttps://doi.org/10.26076/417a-048copenalex-snapshot
Dot Product Graphs and Their Applications to Ecology
inferred← citeshttps://doi.org/10.37236/4444openalex-snapshot
Sphere Representations, Stacked Polytopes, and the Colin de Verdière Number of a Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04258openalex-snapshot
Forbidden Induced Subgraphs for Bounded $p$-Intersection Number
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.