% Encoding: UTF-8

@Book{Berge73,
  author    = {Berge, C.},
  title     = {Graphs and Hypergraphs},
  publisher = {North-Holland, Amsterdam},
  year      = {1973},
}

@Article{Stanley73,
  author  = {Stanley, R.},
  title   = {Acyclic orientations of graphs},
  number  = {2},
  pages   = {171 - 178},
  volume  = {5},
  doi={10.1016/0012-365X(73)90108-8},
  journal = {Discrete Math.},
  year    = {1973},
}

@Article{Boley,
  author  = {Boley, H.},
  title   = {Directed recursive labelnode hypergraphs: a new representation language},
  pages   = {49 -- 85},
  volume  = {9},
  doi={10.1016/0004-3702(77)90014-5},
  journal = {Artif. Intell.},
  year    = {1977},
}

@Article{Luczak,
  author  = {T. {\L}uczak and T. Seierstad},
  title   = {The critical behavior of random digraphs},
  pages   = {271-293},
  volume  = {35},
  doi={10.1002/rsa.20283},
  journal = {Random Struct. Algorithms},
  year    = {2009},
}

@misc{Dovgal2019,
  author        = {De Panafieu, \'E. and Dovgal, S.},
  title         = {Symbolic method and directed graph enumeration},
  eprint        = {1903.09454},
  note          = {To appear in the Proceedings of EuroComb2019},
  eprinttype = {arXiv},
  primaryclass  = {math.CO},
  year          = {2019},
}

@misc{NVS,
  author    = {Ralaivaosaona, D. and Rasendrahasina, V. and Wagner, S.},
  title     = {On the Probability that a Random Digraph is Acyclic},
  note      = {To appear in the Proceedings of AofA2020},
  year      = {2020},
}

@Article{Read1960,
  author  = {R. Read},
  title   = {The number of $k$-colored graphs on labelled nodes},
  volume  = {12},
  journal = {Canad. J. Math.},
  page    = {410--414},
  year    = {1960},
}

@misc{PhD2013,
  author = {Ostroff, J.},
  title  = {Counting Connected Digraphs with Gradings},
  school = {Brandeis University},
  note={Ph.D. thesis.},
  year   = {2013},
}

@Article{Ausiello,
  author  = {Ausiello, G. and Luigi, L.},
  title   = {Directed Hypergraphs: Introduction and fundamental algorithms -- a survey},
  pages   = {293 -- 306},
  volume  = {658},
  doi={10.1016/j.tcs.2016.03.016},
  journal = {Theoret. Comput. Sci.},
  year    = {2017},
}

@Book{Harary1965,
  author    = {Harary, F. and Norman, R. and Cartwright, D.},
  title     = {Structural Models: An introduction to the theory of directed graphs},
  publisher = {Wiley. New York},
  year      = {1965},
}

@Article{Karp,
  author  = {R. Karp},
  title   = {The Transitive Closure of a Random Digraph},
  pages   = {73--94},
  volume  = {1},
  journal = {Random Struct. Algorithms},
  doi={10.1002/rsa.3240010106},
  year    = {1990},
}

@Article{Gallo1993,
  author  = {G. Gallo and G. Longo and S. Pallottino and S. Nguyen},
  title   = {Directed hypergraphs and applications},
  number  = {2},
  pages   = {177--201},
  doi={10.1016/0166-218X(93)90045-P},
  volume  = {42},
  journal = {Discrete Appl. Math.},
  year    = {1993},
}

@Article{Levi76,
  author  = {Levi, G. and Sirovich, F.},
  title   = {Generalized And/Or graphs},
  pages   = {243-259},
  volume  = {7},
  doi={10.1016/0004-3702(76)90006-0},
  journal = {Artificial Intelligence},
  year    = {1976},
}

@Article{Gessel1995,
  author  = {I. Gessel},
  title   = {Enumerative applications of a decomposition for graphs and digraphs},
  number  = {1-3},
  pages   = {257--271},
  doi={10.1016/0012-365X(94)00135-6},
  volume  = {139},
  journal = {Discrete Math.},
  year    = {1995},
}

@Article{Gessel1996,
  author  = {I. Gessel and B. Sagan},
  title   = {The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions},
  number  = {2},
  volume  = {3},
  doi={10.37236/1267},
  journal = {Electr. J. Comb.},
  year    = {1996},
}

@Article{Liskovets69b,
  author  = {Liskovets, V.},
  title   = {On one recurrent method of counting graphs with marked vertices},
  number  = {6},
  pages   = {1284--1287},
  volume  = {184},
  journal = {Dokl. Akad. Nauk BSSR},
  year    = {1969},
}

@Article{Gessel1996b,
  author  = {I. Gessel},
  title   = {Counting acyclic digraphs by sources and sinks},
  number  = {1},
  pages   = {253--258},
  doi={10.1016/0012-365X(95)00119-H},
  volume  = {160},
  journal = {Discrete Math.},
  year    = {1996},
}

@Article{Liskovets69a,
  author  = {Liskovets, V.},
  title   = {Enumeration of rooted initially connected oriented graphs},
  pages   = {23--32},
  journal = {Izv. Akad. Nauk BSSR},
  year    = {1969},
}

@Book{Berge89,
  author    = {Berge, C.},
  title     = {Hypergraphs: Combinatorics of Finite Sets},
  publisher = {North-Holland, Amsterdam},
  year      = {1989},
}

@inproceedings{Martelli73,
  author    = {Martelli, A. and Montanari, U.},
  booktitle = {Proceedings of International Joint Conferences on Artificial Intelligence (IJCAI)},
  title     = {Additive {AND}/{OR} graphs},
  pages     = {1 -- 11},
  year      = {1973},
}

@inproceedings{Robinson70,
  author    = {R. W. Robinson},
  booktitle = {Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications (Univ. North Carolina, Chapel Hill, N.C., 1970 )},
  title     = {Enumeration of acyclic digraphs},
  publisher = {Univ. North Carolina, Chapel Hill, N.C.},
  page      = {391--399},
  year      = {1970},
}

@Book{FSBook,
  author    = {P. Flajolet and B. Sedgewick},
  title     = {Analytic Combinatorics},
  publisher = {Cambridge University Press},
  year      = {2009},
}

@book{Robinson73,
  author    = {Robinson, R.},
  booktitle = {New Directions in Graph Theory (Ed. F. Harary)},
  title     = {Counting labelled acyclic digraphs},
  publisher = {New York: Academic Press},
  year      = {1973},
}

@inproceedings{Robinson95,
  author    = {R. Robinson},
  booktitle = {Combinatorics and Graph Theory},
  title     = {Counting Digraphs with Restrictions on the Strong Components},
  publisher = {Prof. of the Summer School and Conf.},
  volume    = {1},
  page      = {343--354},
  year      = {1995},
}

@book{Robinson77,
  author    = {Robinson, R.},
  booktitle = {Combinatorial Mathematics V},
  title     = {Counting unlabeled acyclic digraphs},
  editor    = {Little, Charles H. C.},
  pages     = {28--43},
  publisher = {Springer Berlin Heidelberg},
  address   = {Berlin, Heidelberg},
  year      = {1977},
}

@Article{Wright1971,
  author  = {Wright, E.},
  title   = {{The Number of Strong Digraphs}},
  number  = {3},
  pages   = {348-350},
  volume  = {3},
  journal = {Bull. Lond. Math. Soc. B},
  month   = {11},
  year    = {1971},
}

@Article{Bender1986,
  author  = {E. Bender and L. Richmond and R. Robinson and N. Wormald},
  title   = {The asymptotic number of acyclic diagraphs {I}},
  number  = {1},
  pages   = {15--22},
  doi={10.1007/BF02579404},
  volume  = {6},
  journal = {Combinatorica},
  year    = {1986},
}

@misc{Gessel2019,
  author        = {Archer, K. and Gessel, I. M. and Graves, C. and Liang, X.},
  title         = {Counting acyclic and strong digraphs by descents},
  eprint        = {1909.01550},
  eprinttype = {arXiv},
  primaryclass  = {math.CO},
  year          = {2019},
}