Sciweavers

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

33

JCT
2007

favoriteEmaildiscussreport

76views more JCT 2007»

Perfect matchings extend to Hamilton cycles in hypercubes

13 years 10 months ago

Perfect matchings extend to Hamilton cycles in hypercubes

Download kam.mff.cuni.cz

Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extended to a Hamilton cycle. We prove this conjecture.

Jirí Fink

Real-time Traffic

Conjecture | Hamilton Cycle | JCT 2007 | Perfect Matching |

claim paper

Related Content

» Matching graphs of Hypercubes and Complete Bipartite Graphs

» Hamilton Cycles in Random Lifts of Directed Graphs

» On the Number of Cycles in Planar Graphs

» On plane bipartite graphs without fixed edges

» Extended formulations in combinatorial optimization

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Jirí Fink

Comments (0)