Enumeration of the degree sequences of non-separable graphs and connected graphs
From MaRDI portal
(Redirected from Publication:1024330)
Recommendations
Cites work
- scientific article; zbMATH DE number 2161041 (Why is no real title available?)
- scientific article; zbMATH DE number 1896944 (Why is no real title available?)
- A note on partitions and compositions defined by inequalities
- A problem of restricted partitions
- Identities in combinatorics. III: Further aspects of ordered set sorting
- MacMahon's partition analysis XI: Broken diamonds and modular forms
- MacMahon's partition analysis. IX: \(k\)-gon partitions
- Non-separable detachments of graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On graphical partitions
- Partitions and compositions defined by inequalities
Cited in
(5)- Enumeration of unigraphical partitions
- scientific article; zbMATH DE number 3941573 (Why is no real title available?)
- Enumeration of the degree sequences of 3-connected graphs and cactus graphs.
- On enumeration of some non-isomorphic edge complete semigraphs
- Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
This page was built for publication: Enumeration of the degree sequences of non-separable graphs and connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024330)