Random packing by \(\rho\)-connected \(\rho\)-regular graphs (Q1126281): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3035337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random packings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über den Zusammenhang symmetrischer Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of transitive graphs / rank
 
Normal rank

Latest revision as of 16:11, 24 May 2024

scientific article
Language Label Description Also known as
English
Random packing by \(\rho\)-connected \(\rho\)-regular graphs
scientific article

    Statements

    Random packing by \(\rho\)-connected \(\rho\)-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2001
    0 references
    0 references
    packing
    0 references
    packable graph
    0 references
    forbidden graph
    0 references
    characterization
    0 references