×

On cubical graphs. (English) Zbl 0301.05104


MSC:

05C10 Planar graphs; geometric and topological aspects of graph theory
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
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, ()
[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, (), 85-104 · Zbl 0366.68041
[10] Kautz, W; Kautz, W, Unit distance error checking codes, I.R.E. trans. elec. computers, I.R.E. trans. elec. computers, 7, 180, (1958)
[11] {\scL. Lovász}, personal communication.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.