On rotational symmetries of drawings of coherent periodic graphs
From MaRDI portal
Publication:324851
DOI10.1016/j.endm.2015.07.062zbMath1347.05129OpenAlexW2211241695MaRDI QIDQ324851
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.062
Applications of graph theory (05C90) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Standard pairs and group relaxations in integer programming
- Isometric embedding of mosaics into cubic lattices
- Some NP-Complete Problems Similar to Graph Isomorphism
- A Geometric Buchberger Algorithm for Integer Programming
- A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs
- Identification of and symmetry computation for crystal nets
- ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs
- Geometry of cuts and metrics