A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube is the dimension of the graph. We show several results concerning this class of graphs. We use a characterization of cubical graphs in terms of edge coloring to show that the dimension of biconnected cubical graphs is at most half the number of nodes. We also show that telling whether a graph is cubical is NP-complete. Finally, we propose a heuristic for minimizing the dimension of trees, which yields an embedding of the tree in a hypercube of dimension at most the square of the true dimension of the tree.
[1]
Michael Randolph Garey,et al.
On cubical graphs
,
1975
.
[2]
I. Havel,et al.
$B$-valuations of graphs
,
1972
.
[3]
L. Nebeský.
On cubes and dichotomic trees
,
1974
.
[4]
Ivan Havel,et al.
Embedding the polytomic tree into the $n$-cube
,
1973
.
[5]
Ivan Havel.
Embedding graphs in undirected and directed cubes
,
1983
.
[6]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[7]
D. Djoković.
Distance-preserving subgraphs of hypercubes
,
1973
.