Graphs 4_n that are isometrically embeddable in hypercubes
classification
🧮 math.CO
keywords
graphgraphscalledclassifyconnectedembeddablefacesgons
read the original abstract
A connected 3-valent plane graph, whose faces are $q$- or 6-gons only, is called a {\em graph $q_n$}. We classify all graphs $4_n$, which are isometric subgraphs of a $m$-hypercube $H_m$.
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.