Sphere and dot product representations of graphs
From MaRDI portal
Publication:411410
DOI10.1007/s00454-012-9394-8zbMath1238.05180MaRDI QIDQ411410
Publication date: 4 April 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-012-9394-8
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Conflict-Free Coloring of Intersection Graphs, Unnamed Item, Unnamed Item, What Graphs are 2-Dot Product Graphs?, Global Rigidity of Unit Ball Graphs, Balanced line separators of unit disk graphs, On the Complexity of Some Geometric Problems With Fixed Parameters, What graphs are 2-dot product graphs?, Fixed points, Nash equilibria, and the existential theory of the reals, On complexity of multidistance graph recognition in \(\mathbb{R}^1\), Implicit representation conjecture for semi-algebraic graphs, On arrangements of orthogonal circles, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, \( L ( 2 , 1 )\)-labeling of disk intersection graphs, A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space graphs and sphericity
- Realizability of combinatorial types of convex polyhedra over fields
- On embedding of graphs into Euclidean spaces of small dimension
- Dot product representations of graphs
- Unit disk graph recognition is NP-hard
- Efficient graph representations
- Embeddings of graphs in Euclidean spaces
- Geometrical embeddings of graphs
- Threshold graphs and related topics
- Integer realizations of disk and segment graphs
- Optimal greedy algorithms for indifference graphs
- The Number of Bits Needed to Represent a Unit Disk Graph
- Implicat Representation of Graphs
- On the combinatorial and algebraic complexity of quantifier elimination
- Oriented Matroids
- Algorithms in real algebraic geometry
