Enumeration of the degree sequences of non-separable graphs and connected graphs

DOI10.1016/j.ejc.2008.10.006zbMath1229.05118OpenAlexW2112972328MaRDI QIDQ1024330

James A. Sellers, Helge Tverberg, Øystein J. Rødseth

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex degrees (05C07)

Uses Software

• Omega

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Enumeration of the degree sequences of non-separable graphs and connected graphs