Graphs 4_n that are isometrically embeddable in hypercubes

2004/11/16 by Michel Deza, Deza, Michel, Mathieu Dutour-Sikiric +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.math/0411359

18 pages, 25 drawings

arxiv created 2004/11/16 · arxiv updated 2009/12/01

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.

Related

• On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
• Decomposition of hypercubes into sunlet graphs
• Extremal numbers for cycles in a hypercube
• An extremal theorem in the hypercube
• Orientable Hamiltonian Embeddings of the Hypercube Graph