𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance-preserving subgraphs of hypercubes

✍ Scribed by D.Ž Djoković

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
298 KB
Volume
14
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hexagon-free subgraphs of hypercubes
Hexagon-free subgraphs of hypercubes
✍ Marston Conder 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract It is shown (for all __n__ ≥ __3__) that the edges of the __n__‐cube can be 3‐colored in such a way that there is no monochromatic 4‐cycle or 6‐cycle. © 1993 John Wiley & Sons, Inc.

On k-detour subgraphs of hypercubes
On k-detour subgraphs of hypercubes
✍ Nana Arizumi; Peter Hamburger; Alexandr Kostochka 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A spanning subgraph __G__ of a graph __H__ is a __k__‐__detour subgraph__ of __H__ if for each pair of vertices $x,y \in V(H)$, the distance, ${\rm dist}\_G(x,y)$, between __x__ and __y__ in __G__ exceeds that in __H__ by at most __k__. Such subgraphs sometimes also are called __additiv

Subgraphs of a hypercube containing no s
Subgraphs of a hypercube containing no small even cycles
✍ Fan R. K. Chung 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 490 KB

## Abstract We investigate several Ramsey‐Turán type problems for subgraphs of a hypercube. We obtain upper and lower bounds for the maximum number of edges in a subgraph of a hypercube containing no four‐cycles or more generally, no 2__k__‐cycles __C__~2k~. These extermal results imply, for exampl