Garey, M. R.; Graham, R. L. On cubical graphs. (English) Zbl 0301.05104 J. Comb. Theory, Ser. B 18, 84-95 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 20 Documents MSC: 05C10 Planar graphs; geometric and topological aspects of graph theory 05C35 Extremal problems in graph theory × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Bouwer, I. Z.; LeBlanc, G., A note on primitive graphs, Canad. Math. Bull., 15, 437-440 (1972) · Zbl 0251.05125 [2] Djokovic, D. Z., Distance-preserving subgraphs of hypercubes, J. Combinatorial Theory Ser. B, 14, 263-267 (1973) · Zbl 0245.05113 [3] Erdös, P., Graph theory and probability I, Canad. J. Math., 11, 34-38 (1959) · Zbl 0084.39602 [4] Firsov, V. V., Isometric embedding of a graph in a Boolean cube, Kiber., 1, 95-96 (1965), Transl. 1 (1965), 112, 113 · Zbl 0152.41102 [5] Harary, F., (Graph Theory (1969), Addison-Wesley: Addison-Wesley New York) · Zbl 0182.57702 [6] Gilbert, E. N., Gray codes and paths on the \(n\)-cube, Bell Sys. Tech. J., 37, 1-12 (1958) [7] Graham, R. L., On primitive graphs and optimal vertex assignments, Ann. N.Y. Acad. Sci., 175, 170-186 (1970) · Zbl 0229.05126 [8] Graham, R. L.; Pollak, H. O., On the addressing problem for loop switching, Bell Sys. Tech. J., 50, 2495-2519 (1971) · Zbl 0228.94020 [9] Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum Press: Plenum Press New York), 85-104 · Zbl 0366.68041 [10] Kautz, W., Unit distance error checking codes, I.R.E. Trans. Elec. Computers, 7, 180 (1958) [11] L. Lovász; L. Lovász This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.