Graphs $4_n$ that are isometrically embeddable in hypercubes

Details Graphs $4_n$ that are isometrically embeddable in hypercubes Graphs $4_n$ that are isometrically embeddable in hypercubes

2004-11-16

arxiv.org/abs/math/0411359v1

Mathematics

Combinatorics

18 pages, 25 drawings

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Graphs $4_n$ that are isometrically embeddable in hypercubes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs $4_n$ that are isometrically embeddable in hypercubes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs $4_n$ that are isometrically embeddable in hypercubes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212525