Graphs 4_n that are isometrically embeddable in hypercubes

zbMATH Open1079.05024arXivmath/0411359MaRDI QIDQ2569293FDOQ2569293

Michel Deza, S. Shpectorov, Mathieu Dutour Sikirić

Publication date: 18 October 2005

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

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$.

Full work available at URL: https://arxiv.org/abs/math/0411359

Recommendations

• Isometric embeddings into cube-hypergraphs
• Isometric embeddings of subdivided connected graphs into hypercubes
• scientific article; zbMATH DE number 1138195
• Isometric embedding of subdivided Connected graphs in the hypercube
• Embeddings of chemical graphs in hypercubes

zbMATH Keywords

plane graphisometric subgraphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (6)

• Polyhexes that are \(\ell _1\) graphs
• Title not available (Why is that?)
• The flip-graph of the 4-dimensional cube is connected
• \(l_1\)-embeddability of generic quadrilateral Möbius maps
• Convex excess in partial cubes
• \(l_1\)-embeddability under the edge-gluing operation on graphs

This page was built for publication: Graphs \(4_n\) that are isometrically embeddable in hypercubes

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