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

DOI10.1016/J.EJC.2008.10.006zbMATH Open1229.05118OpenAlexW2112972328MaRDI QIDQ1024330FDOQ1024330

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

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

Recommendations

• Enumeration of the degree sequences of 3-connected graphs and cactus graphs.
• Enumeration of unigraphical partitions
• Degree sequences in graphs
• Enumeration of the Degree Sequences of Line-Hamiltonian Multigraphs
• Efficient counting of degree sequences

Mathematics Subject Classification ID

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

Cites Work

• Identities in combinatorics. III: Further aspects of ordered set sorting
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• MacMahon's partition analysis XI: Broken diamonds and modular forms
• On graphical partitions
• A note on partitions and compositions defined by inequalities
• A problem of restricted partitions
• Partitions and compositions defined by inequalities
• Title not available (Why is that?)
• Non-separable detachments of graphs
• MacMahon's partition analysis. IX: \(k\)-gon partitions
• Title not available (Why is that?)

Cited In (5)

• Enumeration of unigraphical partitions
• Title not available (Why is that?)
• 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

Uses Software

• Omega

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)