_1-embeddability of 2-dimensional _1-rigid periodic graphs

DOI10.1007/978-3-319-04657-0_32MaRDI QIDQ5746271zbMATH OpenOpenAlexFDO

Authors Norie Fu

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04657-0_32

zbMATH Keywords

\(\ell _{1}\)-embeddable 2-dimensional periodic graphs

Mathematics Subject Classification ID

Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Integer programming (90C10) Distance in graphs (05C12)

Recommendations

• A note on \(l_ 1\)-rigid planar graphs
• Clin d'oeil on L₁-embeddable planar graphs
• scientific article; zbMATH DE number 1078282
• Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
• Algorithms for \(\ell_{1}\)-embeddability and related problems

Cited in

(1)

• On rotational symmetries of drawings of coherent periodic graphs

This page was built for publication: \(\ell _{1}\)-embeddability of 2-dimensional \(\ell _{1}\)-rigid periodic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746271)