Enumeration of the degree sequences of non-separable graphs and connected graphs
From MaRDI portal
Publication:1024330
DOI10.1016/j.ejc.2008.10.006zbMath1229.05118MaRDI QIDQ1024330
Øystein J. Rødseth, Helge Tverberg, James A. Sellers
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.10.006
Uses Software
Cites Work
- Identities in combinatorics. III: Further aspects of ordered set sorting
- Non-separable detachments of graphs
- Partitions and compositions defined by inequalities
- On graphical partitions
- Macmahon's partition analysis IX:K-gon partitions
- MacMahon's partition analysis XI: Broken diamonds and modular forms
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A problem of restricted partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item