Enumeration of the degree sequences of non-separable graphs and connected graphs (Q1024330): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separable detachments of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphical partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identities in combinatorics. III: Further aspects of ordered set sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macmahon's partition analysis IX:<i>K</i>-gon partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4671055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MacMahon's partition analysis XI: Broken diamonds and modular forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem of restricted partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions and compositions defined by inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377490 / rank
 
Normal rank

Latest revision as of 16:45, 1 July 2024

scientific article
Language Label Description Also known as
English
Enumeration of the degree sequences of non-separable graphs and connected graphs
scientific article

    Statements