Graphs $4_n$ that are isometrically embeddable in hypercubes
Combinatorics
2007-05-23 v1
Abstract
A connected 3-valent plane graph, whose faces are - or 6-gons only, is called a {\em graph }. We classify all graphs , which are isometric subgraphs of a -hypercube .
Cite
@article{arxiv.math/0411359,
title = {Graphs $4_n$ that are isometrically embeddable in hypercubes},
author = {Michel Deza and Mathieu Dutour-Sikiric and Sergey Shpectorov},
journal= {arXiv preprint arXiv:math/0411359},
year = {2007}
}
Comments
18 pages, 25 drawings