The prism over the middle-levels graph is Hamiltonian (Q2490424): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q215558
Property / author
 
Property / author: Peter Horák / rank
Normal rank
 

Revision as of 02:09, 11 February 2024

scientific article
Language Label Description Also known as
English
The prism over the middle-levels graph is Hamiltonian
scientific article

    Statements

    The prism over the middle-levels graph is Hamiltonian (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    Let \textbf{B}\(_k\) be the bipartite graph whose vertices are subsets of size \(k\) or \(k+1\) of the set \(\{1,2,\dots,2k+1\}\), and whose edges represent the inclusion between two such subsets. The authors prove that the prism over \textbf{B}\(_k\) is Hamiltonian and that \textbf{B}\(_k\) has a closed spanning 2-trail.
    0 references
    0 references
    Hamiltonian graph
    0 references
    Bipartite graph
    0 references
    Prism
    0 references

    Identifiers