Sciweavers

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

78

DAM
1999

75views more DAM 1999»

On k-partitioning of Hamming Graphs

15 years 2 months ago

On k-partitioning of Hamming Graphs

Download mcs.uwsuper.edu

Sergei L. Bezrukov, Robert Elsässer, Ulf-Pete

Real-time Traffic

DAM 1999 |

claim paper

Related Content

» On Bounds for the kPartitioning of Graphs

» On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs

» The second largest component in the supercritical 2D Hamming graph

» Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan ...

» Distance Labelling Problems for Hypercubes and Hamming Graphs A Survey

» On the Acyclic Chromatic Number of Hamming Graphs

» Binary codes from the line graph of the ncube

» A short proof of a theorem of Bang and Koolen

» On the canonical metric representation average distance and partial Hamming graphs

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DAM
Authors	Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder

Comments (0)