Integer partitions and acyclic directed graphs

zbMATH Open1325.05029MaRDI QIDQ3454271FDOQ3454271

Authors: Mircea Merca 

Publication date: 24 November 2015

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

zbMATH Keywords

treedirected graphinteger partitionascending composition

Mathematics Subject Classification ID

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

Cited In (8)

• A recurrence for counting graphical partitions
• Integer partitions and binary trees
• Sur quelques formes quadratiques associées à des partitions d'entiers
• Title not available (Why is that?)
• Acyclic dominating partitions
• Fast algorithm for generating ascending compositions
• Title not available (Why is that?)
• Path partitions and packs of acyclic digraphs

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)