Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4044717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3088454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Hamiltonian Circuits in the n-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of Hamiltonian circuits in the n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable networks and product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings extend to Hamilton cycles in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148514 / rank
 
Normal rank

Latest revision as of 21:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
scientific article

    Statements

    Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (English)
    0 references
    0 references
    0 references
    16 June 2010
    0 references
    Hamiltonian circuits
    0 references
    matchings
    0 references
    counting problems
    0 references
    hypercube
    0 references
    Cartesian products
    0 references

    Identifiers