Counting extensional acyclic digraphs
From MaRDI portal
Publication:1944136
DOI10.1016/J.IPL.2011.05.014zbMATH Open1260.05077OpenAlexW2086562122MaRDI QIDQ1944136FDOQ1944136
Alberto Policriti, Alexandru I. Tomescu
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.014
Recommendations
automorphism groupcombinatorial problemsset theorytransitive setrecurrence formulaextensional digraph
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Acyclic orientations of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Acyclic orientations and the chromatic polynomial
- Title not available (Why is that?)
- The asymptotic number of acyclic digraphs. I
- The asymptotic number of acyclic digraphs. II
- Counting acyclic digraphs by sources and sinks
- The Number of Full Sets with n Elements
- Title not available (Why is that?)
- Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
- Exact enumeration of acyclic deterministic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-Quasi-Ordering Hereditarily Finite Sets
Cited In (8)
- Set graphs. IV. Further connections with claw-freeness
- Ordinal operations on graph representations of sets
- Title not available (Why is that?)
- Multiplicativity of acyclic digraphs
- Digraph parameters and finite set arithmetic
- Counting acyclic hypergraphs
- Counting acyclic and strong digraphs by descents
- Asymptotic enumeration of extensional acyclic digraphs
Uses Software
This page was built for publication: Counting extensional acyclic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944136)
