Cubical graphs and cubical dimensions
A cubical graph G is isomorphic to a subgraph of some hypercube \(Q_ n\). The cubical dimension cd(G) is the smallest such n. The induced cubical dimension icd(G) is the minimum n for which G is an induced subgraph of \(Q_ n\). The determination for a given cubical graph G of the exact values of cd(G) and icd(G) is very difficult. We discuss these values for some special classes of graphs including trees, unicyclic graphs, ``polyomino'' animals and polyhexes.
scientific article; zbMATH DE number 4051688