Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs (Q1850508): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and Counting Hamilton Cycles in Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Regular Graphs: Asymptotic Distributions and Contiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all cubic graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all regular graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Random Regular Graphs Quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank

Revision as of 18:09, 4 June 2024

scientific article
Language Label Description Also known as
English
Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
scientific article

    Statements

    Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs (English)
    0 references
    0 references
    0 references
    10 December 2002
    0 references
    perfect matchings
    0 references
    asymptotic probability
    0 references
    Hamilton cycle
    0 references
    edge-decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references