✦ LIBER ✦

Embedding Graphs into Cartesian Products

✍ Scribed by WILFRIED IMRICH

Book ID: 119862775
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 449 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16407.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Regular embeddings of Cartesian product

Regular embeddings of Cartesian product graphs

✍ Jun-Yang Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Embeddings of cartesian products of near

Embeddings of cartesian products of nearly bipartite graphs

✍ Bojan Mohar; Tomaž Pisanski; Arthur T. White 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

## Abstract Surgical techniques are often effective in constructing genus embeddings of cartesian products of bipartite graphs. In this paper we present a general construction that is “close” to a genus embedding for cartesian products, where each factor is “close” to being bipartite. In specializi

Cartesian products of block graphs

✍ H. -J. Bandelt 📂 Article 📅 1995 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 250 KB

Embedding into Bipartite Graphs

✍ Böttcher, Julia; Heinig, Peter; Taraz, Anusch 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 337 KB

Factorization of an unconnected graph in

Factorization of an unconnected graph into a Cartesian product

✍ K. A. Zaretskii 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 62 KB