Efficient generation of graphical partitions

DOI10.1016/S0166-218X(97)00022-XzbMath0889.05011OpenAlexW2153659965MaRDI QIDQ1377650

Carla D. Savage, Tiffany M. Barnes

Publication date: 29 May 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

integer partitionsdegree sequences

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Related Items (3)

Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Methods for the graph realization problem ⋮ Efficient counting of degree sequences

Cites Work

• Unnamed Item
• Unnamed Item
• The enumeration of graphical partitions
• A recurrence for counting graphical partitions
• A note on graphical partitions
• On graphical partitions
• Seven criteria for integer sequences being graphic
• A NOTE ON RANKS AND CONJUGACY OF PARTITIONS

This page was built for publication: Efficient generation of graphical partitions