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