Cleaning random \(d\)-regular graphs with brooms (Q659724): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Explicit construction of linear sized tolerant networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning Regular Graphs with Brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced vertex-orderings of graphs / rank
 
Normal rank
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: Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of alon's second eigenvalue conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clean the graph before you draw it! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel cleaning of a network with brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning a network with brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning with brooms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on bipartite subgraphs of triangle‐free 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: Q4938890 / rank
 
Normal rank

Latest revision as of 21:23, 4 July 2024

scientific article
Language Label Description Also known as
English
Cleaning random \(d\)-regular graphs with brooms
scientific article

    Statements

    Cleaning random \(d\)-regular graphs with brooms (English)
    0 references
    0 references
    24 January 2012
    0 references
    cleaning with brushes
    0 references
    cleaning with Broom number
    0 references
    random \(d\)-regular graphs
    0 references
    differential equations method
    0 references
    graph searching
    0 references

    Identifiers