Counting acyclic digraphs by sources and sinks
From MaRDI portal
Publication:1126301
DOI10.1016/0012-365X(95)00119-HzbMath0863.05042MaRDI QIDQ1126301
Publication date: 8 December 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Generating connected acyclic digraphs uniformly at random ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ The birth of the strong components ⋮ Counting acyclic and strong digraphs by descents ⋮ Counting extensional acyclic digraphs ⋮ Counting directed acyclic and elementary digraphs ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ Acyclic orientations and the chromatic polynomial ⋮ Acyclic Digraphs ⋮ Random Generation of Directed Acyclic Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A noncommutative version of the matrix inversion formula
- Computation of the expected number of leaves in a tree having a given automorphism, and related topics
- On the number of labeled acyclic digraphs
- \(q\)-enumeration of convex polyominoes
- Enumerative applications of a decomposition for graphs and digraphs
- The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
- Combinatorial problems of commutation and rearrangements
- Acyclic orientations of graphs
- On the Number of Maximal Vertices of a Random Acyclic Digraph
- The number of labeled k-trees
This page was built for publication: Counting acyclic digraphs by sources and sinks