\(\ell^1\) and \(\ell^\infty\) plane

DOI10.37236/8196zbMath1441.05071OpenAlexW3037167818MaRDI QIDQ2188841

Katie Clinch, Derek Kitson

Publication date: 15 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8196

zbMATH Keywords

\(d\)-tree decompositiongraphs rigidity

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21)

Cites Work

• Unnamed Item
• Unnamed Item
• Gain-sparsity and symmetry-forced rigidity in the plane
• Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
• Frameworks with forced symmetry. I: Reflections and rotations
• Finite and infinitesimal rigidity with polyhedral norms
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• Constructive characterizations for packing and covering with trees
• Motions of grid-like reflection frameworks
• Connected rigidity matroids and unique realizations of graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Infinitesimal rigidity for non-Euclidean bar-joint frameworks
• Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks

This page was built for publication: \(\ell^1\) and \(\ell^\infty\) plane