Pages that link to "Item:Q411410"

The following pages link to Sphere and dot product representations of graphs (Q411410):

Displaying 38 items.

• What graphs are 2-dot product graphs? (Q322356) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• Dot product representations of planar graphs (Q648410) (← links)
• Dot product representations of graphs (Q1381853) (← links)
• The structure of spherical graphs. (Q1427979) (← links)
• On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
• Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
• Optimization problems over unit-distance representations of graphs (Q1953430) (← links)
• On arrangements of orthogonal circles (Q2206852) (← links)
• Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit (Q2230920) (← links)
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
• Dot product dimensions of graphs (Q2636805) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
• What Graphs are 2-Dot Product Graphs? (Q5024919) (← links)
• On Embeddability of Unit Disk Graphs onto Straight Lines (Q5042239) (← links)
• Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs (Q5042449) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• (Q5115779) (← links)
• Conflict-free coloring of intersection graphs (Q5136250) (← links)
• Global Rigidity of Unit Ball Graphs (Q5210905) (← links)
• Sphere and dot product representations of graphs (Q5404444) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Computing a maximum clique in geometric superclasses of disk graphs (Q5918528) (← links)
• Balanced line separators of unit disk graphs (Q5918796) (← links)
• On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
• Spherical graph drawing by multi-dimensional scaling (Q6117037) (← links)
• (Q6124760) (← links)
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
• Logical labeling schemes (Q6172301) (← links)
• The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
• Moduli spaces of geometric graphs (Q6596249) (← links)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
• On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
• Dot product dimension of unicyclic graphs (Q6633534) (← links)