scientific article; zbMATH DE number 3294293
From MaRDI portal
Publication:5576813
Cited in
(7)- Counting acyclic and strong digraphs by descents
- Generating functions of some families of directed uniform hypergraphs
- Exact enumeration of acyclic deterministic automata
- The number of strongly connected directed graphs
- Minimal strong digraphs
- Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
- Depth-first search as a combinatorial correspondence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576813)