Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The searching over separators strategy to solve some NP-hard problems in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Circuits and Long Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse pseudo‐random graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank

Latest revision as of 20:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Small spectral gap in the combinatorial Laplacian implies Hamiltonian
scientific article

    Statements

    Small spectral gap in the combinatorial Laplacian implies Hamiltonian (English)
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    Hamiltonian
    0 references
    combinatorial Laplacian
    0 references
    spectral graph theory
    0 references

    Identifiers