Counting the 10-point graphs by partition (Q3919739): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190050208 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068594264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Graphs with Given Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of S-Functions in Combinatorial Analysis / rank
 
Normal rank

Latest revision as of 13:31, 13 June 2024

scientific article
Language Label Description Also known as
English
Counting the 10-point graphs by partition
scientific article

    Statements

    Counting the 10-point graphs by partition (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    labelled graphs
    0 references
    unlabelled graphs
    0 references
    degree sequences
    0 references
    Burnside's lemma
    0 references
    enumeration methods
    0 references
    0 references