The prism over the middle-levels graph is Hamiltonian (Q2490424)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5021474
Language Label Description Also known as
default for all languages
No label defined
    English
    The prism over the middle-levels graph is Hamiltonian
    scientific article; zbMATH DE number 5021474

      Statements

      The prism over the middle-levels graph is Hamiltonian (English)
      0 references
      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