Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
JCT
2007
favorite
Email
discuss
report
76
views
more
JCT 2007
»
Perfect matchings extend to Hamilton cycles in hypercubes
13 years 10 months ago
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
more »
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)
Researcher Info
JCT 2008 Study Group
Computer Vision