Integer partitions and acyclic directed graphs

MaRDI QIDQ3454271zbMATH OpenFDO

Authors Mircea Merca

Publication date 24 November 2015

zbMATH Keywords

ascending compositiondirected graphinteger partitiontree

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Fast algorithms for genegrating integer partitions
• scientific article; zbMATH DE number 1472186
• Efficient generation of graphical partitions
• Fast algorithm for generating ascending compositions
• On the partition lattice of all integers

Cited in

(11)

• Path partitions and packs of acyclic digraphs
• An efficient representation of partitions of integers
• A recurrence for counting graphical partitions
• Fast algorithm for generating ascending compositions
• Sur quelques formes quadratiques associées à des partitions d'entiers
• scientific article; zbMATH DE number 1472186 (Why is no real title available?)
• scientific article; zbMATH DE number 1409240 (Why is no real title available?)
• Cell patterns in integer partitions
• Acyclic dominating partitions
• Partitions and labeled trees
• Integer partitions and binary trees

This page was built for publication: Integer partitions and acyclic directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454271)