AbstractA consequence of the main theorem presented here is a companion result to that of |2| (see also |1|): a finite undirected graph is a quotient of a rigid one if and only if it has no 2-colourable components. In fact, any graph of finitely many components none of which is 2-colourable is a common quotient of graphs that form a universal (or binding) category
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite ...
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as ...
AbstractA d-dimensional framework is a straight line realization of a graph G in Rd. We shall only c...
AbstractA consequence of the main theorem presented here is a companion result to that of |2| (see a...
AbstractThe purpose of this paper is to prove that a given graph G with chromatic number k (k finite...
AbstractWe prove that every finite undirected graph is a full subgraph of a rigid graph. Our constru...
We characterize those finite digraphs which are homomorphic images of rigid graphs. In the infinite ...
Any countable Kn-free graph T embeds as a moiety into the universal homogeneous Kn-free graph Kn in ...
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional...
Inductive constructions are established for countably infinite simple graphs which have minimally ri...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
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...
A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightar...
AbstractFor each finite core graph G there is a countable universal pseudo-homogeneous G-colourable ...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite ...
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as ...
AbstractA d-dimensional framework is a straight line realization of a graph G in Rd. We shall only c...
AbstractA consequence of the main theorem presented here is a companion result to that of |2| (see a...
AbstractThe purpose of this paper is to prove that a given graph G with chromatic number k (k finite...
AbstractWe prove that every finite undirected graph is a full subgraph of a rigid graph. Our constru...
We characterize those finite digraphs which are homomorphic images of rigid graphs. In the infinite ...
Any countable Kn-free graph T embeds as a moiety into the universal homogeneous Kn-free graph Kn in ...
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional...
Inductive constructions are established for countably infinite simple graphs which have minimally ri...
AbstractThe recent combinatorial characterization of generic global rigidity in the plane by Jackson...
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...
A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightar...
AbstractFor each finite core graph G there is a countable universal pseudo-homogeneous G-colourable ...
We present three results which support the conjecture that a graph is minimally rigid in d-dimension...
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite ...
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as ...
AbstractA d-dimensional framework is a straight line realization of a graph G in Rd. We shall only c...
DOI
Add to ORKG