On Hamiltonian circuits and spanning trees of hypercubes

Previous | Up | Next

Article

On Hamiltonian circuits and spanning trees of hypercubes. (English). Časopis pro pěstování matematiky, vol. 109 (1984), issue 2, pp. 135-152

References:

[1] S. Foldes: A characterization of hypercubes. Discrete Math., 17 (1977), 155-159. MR 0450136 | Zbl 0354.05045

[2] F. Harary: Graph Theory. Addison-Wesley, 1969. MR 0256911 | Zbl 0196.27202

[3] I. Havel P. Liebl: Embedding the dichotomic tree into the cube. (Czech with English summary). Čas. pěst. mat. 97 (1972), 201-205. MR 0306025

[4] I. Havel P. Liebl: Embedding the polytomic tree into the n-cube. Čas. pěst. mat. 98 (1973), 307-314. MR 0325430

[5] I. Havel J. Morávek: B-valuations of graphs. Czech. Math. Journ., 22 (1972), 338-351. MR 0294159

[6] J.-M. Laborde S. P. Rao Hebbare: Another characterization of hypercubes. Discrete Math., 39 (1982), 161-166. MR 0675861

[7] H. M. Mulder: The interval function of a graph. Mathematical Centrum, Amsterdam, 1980. MR 0605838 | Zbl 0446.05039

[8] L. Nebeský: On cubes and dichotomic trees. Čas. pěst. mat. 99 (1974), 164-167. MR 0354425

[9] L. Nebeský: On quasistars in n-cubes. Čas. pěst. mat. 109 (1984), 153-156. MR 0744872

Partner of