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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11083-005-9008-7 / rank
Normal rank
 
Property / author
 
Property / author: Peter Horák / rank
Normal rank
 
Property / author
 
Property / author: Peter Horák / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11083-005-9008-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016863833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of prisms over cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit 1-factorization in the middle of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic matchings cannot form Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in prisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit matchings in the middle levels of the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Hamiltonian prisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949820 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11083-005-9008-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:52, 18 December 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
    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