Constructing uniquely realizable graphs
From MaRDI portal
Publication:393739
DOI10.1007/s00454-013-9545-6zbMath1280.05092OpenAlexW2065259354MaRDI QIDQ393739
Publication date: 24 January 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9545-6
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Universal completability, least eigenvalue frameworks, and vector colorings, Graph homomorphisms via vector colorings, Vector coloring the categorical product of graphs, Iterative universal rigidity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing the universal rigidity of generic frameworks
- Eigenvalue bounds for independent sets
- Why almost all \(k\)-colorable graphs are easy to color
- Ramanujan graphs
- Rigidity and energy
- Geometric algorithms and combinatorial optimization
- Problems of distance geometry and convex properties of quadratic maps
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Rigidity and polynomial invariants of convex polytopes
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
- Expander graphs and their applications
- Graph Partitioning via Adaptive Spectral Techniques
- Approximate graph coloring by semidefinite programming
- Tensegrity Frameworks
- Conditions for Unique Graph Realizations
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers
- Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
- Colouring Semirandom Graphs
- On chromatic number of finite set-systems
- Uniquely colorable graphs
- Circular chromatic number: A survey
