Efficient counting of degree sequences

DOI10.1016/j.disc.2018.11.024zbMath1403.05067arXiv1604.04148OpenAlexW2963813761WikidataQ128746065 ScholiaQ128746065MaRDI QIDQ1712538

Peng Zhang

Publication date: 22 January 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04148

zbMATH Keywords

enumerationdegree sequence\(k\)-connected graphgraphical partition

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items

On the necessity of Chvátal’s Hamiltonian degree condition

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inversion of cycle index sum relations for 2- and 3-connected graphs
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Efficient generation of graphical partitions
• Linear recurrences with constant coefficients: The multivariate case
• Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
• Confirming two conjectures about the integer partitions
• Dominance order and graphical partitions
• A recurrence for counting graphical partitions
• A note on graphical partitions
• Threshold graphs and related topics
• Reverse search for enumeration
• On graphical partitions
• Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
• Enumeration of non-separable graphs
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• Existence of k-edge connected ordinary graphs with prescribed degrees