Nieminen, Juhani; Peltola, Matti; Ruotsalainen, Pasi Two characterizations of hypercubes. (English) Zbl 1217.05195 Electron. J. Comb. 18, No. 1, Research Paper P97, 10 p. (2011). Summary: Two characterizations of hypercubes are given: 1) A graph is a hypercube if and only if it is antipodal and bipartite (0, 2)-graph. 2) A graph is an \(n\)-hypercube if and only if there are \(n\) pairs of prime convexes, the graph is a prime convex intersection graph, and each intersection of \(n\) prime convexes (no one of which is from the same pair) is a vertex. MSC: 05C75 Structural characterization of families of graphs 05C65 Hypergraphs PDFBibTeX XMLCite \textit{J. Nieminen} et al., Electron. J. Comb. 18, No. 1, Research Paper P97, 10 p. (2011; Zbl 1217.05195) Full Text: EuDML EMIS