N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, vol.29, issue.2, pp.125-134, 1992.
DOI : 10.1007/BF01204715

N. Alon and Z. Tuza, The acyclic orientation game on random graphs, Random Structures & Algorithms, vol.6, issue.2-3, pp.2-3, 1995.
DOI : 10.1137/0216066

D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996.
DOI : 10.1016/0166-218X(95)00026-N
URL : http://doi.org/10.1016/0166-218x(95)00026-n

V. C. Barbosa and J. L. Szwarcfiter, Generating all the acyclic orientations of an undirected graph, Information Processing Letters, vol.72, issue.1-2, pp.71-74, 1999.
DOI : 10.1016/S0020-0190(99)00120-9

B. Benson, D. Chakrabarty, and P. Tetali, G-parking functions, acyclic orientations and spanning trees, Discrete Math, pp.310-1340, 2010.

B. Bollobas, Extremal Graph Theory, 2004.
DOI : 10.1201/b16132-57

A. Conte, R. Grossi, A. Marino, and R. Rizzi, Enumerating Cyclic Orientations of a Graph, Combinatorial Algorithms -26th International Workshop, IWOCA 2015, pp.88-99, 2015.
DOI : 10.1007/978-3-319-29516-9_8
URL : https://hal.archives-ouvertes.fr/hal-01557026

A. Conte, R. Grossi, A. Marino, and R. Rizzi, Listing Acyclic Orientations of Graphs with Single and Multiple Sources, LATIN 2016: Theoretical Informatics -12th Latin American Symposium, pp.319-333, 2016.
DOI : 10.1007/978-3-662-49529-2_24
URL : https://hal.archives-ouvertes.fr/hal-01388470

A. Conte, R. Grossi, A. Marino, and L. Versari, Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, pp.1-14815, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388461

P. Erd?s and L. Pósa, On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen, vol.9, pp.3-12, 1962.

D. C. Fisher, K. Fraughnaugh, L. Langley, and D. B. West, The Number of Dependent Arcs in an Acyclic Orientation, Journal of Combinatorial Theory, Series B, vol.71, issue.1, pp.73-78, 1997.
DOI : 10.1006/jctb.1997.1769

B. Iriarte, Graph Orientations and Linear Extensions, Mathematics of Operations Research, pp.945-956, 2014.
DOI : 10.1287/moor.2016.0845
URL : https://hal.archives-ouvertes.fr/hal-01207561

A. Itai and M. Rodeh, Finding a Minimum Circuit in a Graph, SIAM Journal on Computing, vol.7, issue.4, pp.413-423, 1978.
DOI : 10.1137/0207033

R. Johnson, Network reliability and acyclic orientations, Networks, vol.1, issue.4, pp.489-505, 1984.
DOI : 10.1007/978-1-349-03521-2

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

J. Moon, Topics on Tournaments, Athena Series: Selected Topics in Mathematics, 1968.

O. Pikhurko, Finding an Unknown Acyclic Orientation of a Given Graph, Combinatorics, Probability and Computing, vol.10, issue.01, pp.121-131, 2010.
DOI : 10.1007/s00453-004-1100-7

B. Roy, Nombre chromatique et plus longs chemins d'un graphe, Revue fran??aise d'informatique et de recherche op??rationnelle, vol.1, issue.5, pp.129-132, 1967.
DOI : 10.1051/m2an/1967010501291

B. Schwikowski and E. Speckenmeyer, On enumerating all minimal solutions of feedback problems, Discrete Applied Mathematics, vol.117, issue.1-3, pp.253-265, 2002.
DOI : 10.1016/S0166-218X(00)00339-5

A. Setiawan and S. Nakano, Listing All st-Orientations, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.94, issue.10, pp.1965-1970, 2011.
DOI : 10.1587/transfun.E94.A.1965

M. B. Squire, Generating the Acyclic Orientations of a Graph, Journal of Algorithms, vol.26, issue.2, pp.275-290, 1998.
DOI : 10.1006/jagm.1997.0891

R. P. Stanley, Acyclic orientations of graphs, Discrete Math, pp.171-178, 1973.

R. P. Stanley, What Is Enumerative Combinatorics?, 1986.
DOI : 10.1017/cbo9781139058520.002

J. L. Szwarcfiter, R. C. Persiano, and A. A. Oliveira, Orientations with single source and sink, Discrete Applied Mathematics, vol.10, issue.3, pp.313-321, 1985.
DOI : 10.1016/0166-218X(85)90052-6
URL : http://doi.org/10.1016/0166-218x(85)90052-6

R. E. Tarjan, A note on finding the bridges of a graph, Information Processing Letters, vol.2, issue.6, pp.160-161, 1974.
DOI : 10.1016/0020-0190(74)90003-9

L. Vitaver, Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix, Dokl. Akad. Nauk SSSR, vol.147, p.728, 1962.