Rhombic embeddings of planar graphs with faces of degree 4
classification
🧮 math-ph
math.DGmath.MP
keywords
embeddingsdegreefacesplanarconditiondescriptionedgesembedding
read the original abstract
Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such embeddings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.