Small maximal matchings of random cubic graphs (Q3652558): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum independent dominating sets of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Edge Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917278 / 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: Global optimization method for solving the minimum maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all regular graphs are hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic connectivity of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 07:08, 2 July 2024

scientific article
Language Label Description Also known as
English
Small maximal matchings of random cubic graphs
scientific article

    Statements

    Identifiers

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