Matching graphs of Hypercubes and Complete bipartite graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004878" target="_blank" >RIV/00216208:11320/07:00004878 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Matching graphs of Hypercubes and Complete bipartite graphs
Original language description
Kreweras' conjecture asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle. We proved this conjecture but here we present a simplified proof. The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We prove that the matching graph of the d-dimensional hypercube is bipartite for d
Czech name
Matching graf hyperkrychle a uplneho bipartitniho grafu
Czech description
Krewerasova hypotéza tvrdí, že každé perfektní párování lze rozšířit na hamiltonovskou kružnici. Tuto hypotézu jsme dokázali dříve, ale zde ukazujeme jednodušší důkaz.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GD201%2F05%2FH014" target="_blank" >GD201/05/H014: Collegium Informaticum</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)