Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

GC
2008
Springer

favoriteEmaildiscussreport

118views Applied Computing» more GC 2008»

On 2-Detour Subgraphs of the Hypercube

13 years 11 months ago

On 2-Detour Subgraphs of the Hypercube

Download www.math.uiuc.edu

A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by showing that for some positive constant c and every n, each 2-detour subgraph of the n-dimensional hypercube Qn has at least c log2 n

József Balogh, Alexandr V. Kostochka

Real-time Traffic

2-detour Subgraph | Applied Computing | Extremal Subgraph | GC 2008 | N-dimensional Hypercube Qn |

claim paper

Related Content

» Embedding ladders and caterpillars into the hypercube

» Partial cubes structures characterizations and constructions

» Recursive faulttolerance of Fibonacci cube in hypercubes

» Edgecritical isometric subgraphs of hypercubes

» On kdetour subgraphs of hypercubes

» A Convexity Lemma and Expansion Procedures for Bipartite Graphs

» A theorem on Wienertype invariants for isometric subgraphs of hypercubes

» A Ramseytype result for the hypercube

» Gray Code Compression

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	GC
Authors	József Balogh, Alexandr V. Kostochka

Comments (0)