AbstractA graph G=(V,E) is said to be 6-mixed-connected if G−U−D is connected for all sets U⊆V and D⊆E which satisfy 2|U|+|D|≤5. In this note we prove that 6-mixed-connected graphs are (redundantly globally) rigid in the plane. This improves on a previous result of Lovász and Yemini
A graph G=(V,E) is d-sparse if each subset X⊆V with |X|≥d induces at most d|X|−(d+12) edges in G. Ma...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...
A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the u...
AbstractA graph G=(V,E) is said to be 6-mixed-connected if G−U−D is connected for all sets U⊆V and D...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightar...
In [9] Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions fo...
International audienceWe prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and ...
AbstractA straight-line realization of (or a bar-and-joint framework on) graph G in Rd is said to be...
A graph G is said to be k-vertex rigid in R-d if G - X is rigid in R-d for all subsets X of the vert...
In [9] Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions fo...
Abstract. We examine the generic local and global rigidity of various graphs in Rd. Bruce Hendrickso...
We show that a generic framework (G,p) on the cylinder is globally rigid if and only if G is a compl...
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as ...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
A graph G=(V,E) is d-sparse if each subset X⊆V with |X|≥d induces at most d|X|−(d+12) edges in G. Ma...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...
A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the u...
AbstractA graph G=(V,E) is said to be 6-mixed-connected if G−U−D is connected for all sets U⊆V and D...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightar...
In [9] Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions fo...
International audienceWe prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and ...
AbstractA straight-line realization of (or a bar-and-joint framework on) graph G in Rd is said to be...
A graph G is said to be k-vertex rigid in R-d if G - X is rigid in R-d for all subsets X of the vert...
In [9] Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions fo...
Abstract. We examine the generic local and global rigidity of various graphs in Rd. Bruce Hendrickso...
We show that a generic framework (G,p) on the cylinder is globally rigid if and only if G is a compl...
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as ...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
A graph G=(V,E) is d-sparse if each subset X⊆V with |X|≥d induces at most d|X|−(d+12) edges in G. Ma...
AbstractA simple undirected graph G=(V,E) is a rigidity circuit if |E|=2|V|−2 and |EG[X]|≤2|X|−3 for...
A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the u...
DOI
Add to ORKG