✦ LIBER ✦

A characterization of hypercubes

✍ Scribed by S. Foldes

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 306 KB
Volume: 17
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90145-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Another characterization of hypercubes

✍ Jean-Marie Laborde; Surya Prakash Rao Hebbare 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Nous montrons que dans la classe des graphes connexes tels ;lue deux a&es incidentes quelconques appartiennent a un et un seul quadrilatere, les hypercrtbes finis sont les graphes de degre minimum n lini et possedant 2" sommets. The fol!owing theorem' is proved: Let % be the class of connected grap

Distance monotone graphs and a new chara

Distance monotone graphs and a new characterization of hypercubes

✍ Gustav Burosch; Ivan Havel; Jean-Marie Laborde 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Burosch, G., I. Have1 and J.-M. Laborde, Distance monotone graphs and a new characterization of hypercubes, Discrete Mathematics 110 (1992) 9-16.

Edge-colourings characterizing a class o

Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes

✍ Marco Buratti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Retracts of hypercubes

✍ H. J. Bandelt 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

A generalization of hypercubes: Compleme

A generalization of hypercubes: Complemented graphs

✍ J. Nieminen; M. Peltola 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 486 KB

## Communicated by A. Tucker Abstract--Complemented graphs are a direct generalization of hypercubes as well as a special class of prime convex intersection graphs. The n-tuple representation of points of a hypercube Qn is extended to prime convex intersection graphs.

Spanning caterpillars of a hypercube

✍ Dvo?�k, Tom�?k; Havel, Ivan; Laborde, Jean-Marie; Mollard, Michel 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

Spanning trees of the hypercube Q n have been recently studied by several authors. In this paper, we construct spanning trees of Q n which are caterpillars and establish quantitative bounds for a caterpillar to span Q n . As a corollary, we disprove a conjecture of Harary and Lewinter on the length