Globally rigid powers of graphs
DOI10.1016/j.jctb.2022.02.004zbMath1487.05185OpenAlexW4214648998MaRDI QIDQ2131861
Tibor Jordán, Shin-ichi Tanigawa
Publication date: 27 April 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2022.02.004
molecular graphedge-disjoint spanning treespowers of graphsglobal rigidityrigid frameworkrigid graphsquares of graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph representations (geometric and intersection representations, etc.) (05C62) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Highly connected molecular graphs are rigid in three dimensions
- A proof of the molecular conjecture
- Generic global rigidity of body-hinge frameworks
- Brick partitions of graphs
- Rigid components in molecular graphs
- On the rigidity of molecular graphs
- Connected rigidity matroids and unique realizations of graphs
- Sufficient conditions for the global rigidity of graphs
- Generic global rigidity
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- The \(d\)-dimensional rigidity matroid of sparse graphs
- The Rigidity of Spherical Frameworks: Swapping Blocks and Holes
- ON AFFINE RIGIDITY
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- Minimally n-line connected graphs.
This page was built for publication: Globally rigid powers of graphs
