A survey of the theory of hypercube graphs
type: Item
instance of: scholarly article
title: A survey of the theory of hypercube graphs
zbMATH Open document ID: 0645.05061
DOI: 10.1016/0898-1221(88)90213-1
author: Frank Harary
author: John P. Hayes
author: Horng-Jyh Wu
publication date: 1988-01-01T00:00:00Z
full work available at URL: http://hdl.handle.net/2027.42/27522
review text: We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to distance, coloring, domination and genus are reviewed. The properties of the n-cube defined by its subgraphs are considered next, including thickness, Hamiltonian cycles and induced paths and cycles. Finally, various embedding and packing problems are discussed, including the determination of the cubical dimension of a given cubical graph.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05-02
zbMATH DE Number: 4051683
zbMATH Keywords: survey
zbMATH Keywords: hypercube graphs
Wikidata QID: Q55934465
MaRDI profile type: Publication
OpenAlex ID: W2054204410
cites work: Parallel concepts in graph theory
cites work: A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
cites work: Q3270978
cites work: Maximum versus minimum invariants for graphs
cites work: Towards a theory of domination in graphs
cites work: Q3947698
cites work: Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
cites work: The Genus of the n-Cube
cites work: On the Stable Crossing Number of Cubes
cites work: Die dicke des n-dimensionalen Würfel-graphen
cites work: Bounds on the Coarseness of the n-Cube
cites work: Bounds on the number of Hamiltonian circuits in the n-cube
cites work: On the Number of Hamiltonian Circuits in the n-Cube
cites work: Cospectral Graphs and Digraphs
cites work: Q5613844
cites work: Acquaintance Graph Party Problem
cites work: A characterization of hypercubes
cites work: On cubical graphs
cites work: Another characterization of hypercubes
cites work: A characterization of the n-cube by convex subgraphs
cites work: Convexity in graphs
cites work: A Graph Model for Fault-Tolerant Computing Systems
cites work: Q5663904
cites work: On Homeomorphic Embeddings of Km,n in the Cube
cites work: Proof of the squashed cube conjecture
cites work: $B$-valuations of graphs
cites work: On Hamiltonian circuits and spanning trees of hypercubes
cites work: Q3041106
cites work: Embedding the dichotomic tree into the $n$-cube
cites work: Embedding the polytomic tree into the $n$-cube
cites work: One-legged caterpillars span hypercubes
cites work: On cubes and dichotomic trees
cites work: On quasistars in $n$-cubes
cites work: The starlike trees which span a hypercube
cites work: Smallest maximal matchings in the graph of the d-dimensional cube
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4051683