On cubical graphs
From MaRDI portal
Publication:1215634
DOI10.1016/0095-8956(75)90067-2zbMath0301.05104OpenAlexW2164898082MaRDI QIDQ1215634
Ronald L. Graham, Michael R. Garey
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90067-2
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Topes of oriented matroids and related structures, A survey of the theory of hypercube graphs, Cubical graphs and cubical dimensions, Isometric embeddings in Hamming graphs, Recognizing binary Hamming graphs inO(n 2 logn) time, Representation of finite graphs as difference graphs of \(S\)-units. I, Functionality of box intersection graphs, On the complexity of testing a graph for n-cube, Resonance graphs on perfect matchings of graphs on surfaces, Hypercube embedding heuristics: An evaluation, Packing the hypercube, Distance regular subgraphs of a cube, Cover-preserving order embeddings into Boolean lattices, A characterization of hypercubes, On the complexity of the embedding problem for hypercube related graphs, Subgraphs of hypercubes and subdiagrams of Boolean lattices, On density of subgraphs of halved cubes, On subgraphs of Cartesian product graphs and S-primeness, The number of edges in a subgraph of a Hamming graph, Optimal gray-code labeling and recognition algorithms for hypercubes
Cites Work