✦ LIBER ✦

Isometric embedding in products of complete graphs

✍ Scribed by Peter M. Winkler

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 325 KB
Volume: 7
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90069-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster isometric embedding in products o

Faster isometric embedding in products of complete graphs

✍ Franz Aurenhammer; Michael Formann; Ramana M. Idury; Alejandro A. Schäffer; Fran 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Isometric embeddings in Hamming graphs

✍ Elke Wilkeit 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Isometric embedding of a graph in a Bool

Isometric embedding of a graph in a Boolean cube

✍ V. V. Firsov 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 163 KB

Embedding Cartesian Products of Graphs i

Embedding Cartesian Products of Graphs into de Bruijn Graphs

✍ Thomas Andreae; Michael Nölle; Gerald Schreiber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 172 KB

## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 × • • • × G m which are relevant for parallel computing, namely, to

Special embeddings of the complete graph

✍ Gary Haggard 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 165 KB

Embedding edge-colored complete graphs i

Embedding edge-colored complete graphs in binary affine spaces

✍ Peter J Cameron 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 876 KB