Almost all graphs are rigid-revisited (Q1044909): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric relations (undirected graphs) with given semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rigid Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum order of graphs with given semigroup / rank
 
Normal rank

Latest revision as of 07:50, 2 July 2024

scientific article
Language Label Description Also known as
English
Almost all graphs are rigid-revisited
scientific article

    Statements

    Almost all graphs are rigid-revisited (English)
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    almost all graphs
    0 references
    rigid graphs
    0 references
    unretractive graphs
    0 references
    0 references