Sciweavers

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

13

ARSCOM
2006

favoriteEmaildiscussreport

54views more ARSCOM 2006»

Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges

13 years 4 months ago

Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges

Download qdkang.hebtu.edu.cn

Zihong Tian, Yanke Du, Qingde Kang

Real-time Traffic

ARSCOM 2006 |

claim paper

Related Content

» Lower bounds for twoperiod grooming via linear programming duality

» Approximately Counting Embeddings into Random Graphs

» Colored graphs without colorful cycles

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ARSCOM
Authors	Zihong Tian, Yanke Du, Qingde Kang

Comments (0)