Graphs $4_n$ that are isometrically embeddable in hypercubes

Simple item page
dc.creatorDeza, Michel
dc.creatorDutour-Sikiric, Mathieu
dc.creatorShpectorov, Sergey
dc.date2004-11-16
dc.date.accessioned2026-07-07T05:14:23Z
dc.date.available2026-07-07T05:14:23Z
dc.descriptionA 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$.
dc.description18 pages, 25 drawings
dc.identifierhttps://arxiv.org/abs/math/0411359
dc.identifierhttp://arxiv.org/abs/math/0411359
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/73256
dc.subjectCombinatorics
dc.titleGraphs $4_n$ that are isometrically embeddable in hypercubes
dc.typetext

Files

Collections

arXiv