R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, Network information flow. Information Theory, IEEE Transactions on, vol.46, issue.4, pp.1204-1216, 2000.

R. Albert, Boolean Modelingof Genetic Regulatory Networks, Complex Networks, pp.459-481, 2004.
DOI : 10.1007/978-3-540-44485-5_21

J. Aracena, Maximum Number of Fixed Points in Regulatory Boolean Networks, Bulletin of Mathematical Biology, vol.19, issue.5, pp.1398-1409, 2008.
DOI : 10.1002/bbpc.19940980916

J. Aracena, A. Richard, and L. Salinas, Maximum number of fixed points in AND???OR???NOT networks, Journal of Computer and System Sciences, vol.80, issue.7, pp.1175-1190, 2014.
DOI : 10.1016/j.jcss.2014.04.025
URL : https://hal.archives-ouvertes.fr/hal-01298835

S. Bornholdt, Boolean network models of cellular regulation: prospects and limitations, Journal of The Royal Society Interface, vol.vol. XVII, issue.2, pp.85-94, 2008.
DOI : 10.1016/S0955-0674(03)00017-6
URL : http://rsif.royalsocietypublishing.org/content/royinterface/5/Suppl_1/S85.full.pdf

P. Erdös, On a lemma of Littlewood and Offord, Bulletin of the American Mathematical Society, vol.51, issue.12, pp.898-902, 1945.
DOI : 10.1090/S0002-9904-1945-08454-7

L. Péter, Z. Erdos, . Füredi, O. Gyula, and . Katona, Two-part and k-sperner families: new proofs using permutations, SIAM Journal on Discrete Mathematics, vol.19, issue.2, pp.489-500, 2005.

M. Gadouleau, A. Richard, and S. Riis, Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, SIAM Journal on Discrete Mathematics, vol.29, issue.4, pp.2312-2335, 2015.
DOI : 10.1137/140988358
URL : https://hal.archives-ouvertes.fr/hal-01298045

M. Gadouleau, A. Richard, and E. Fanchon, Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability, IEEE Transactions on Information Theory, vol.62, issue.5, pp.2504-2519, 2016.
DOI : 10.1109/TIT.2016.2544344
URL : https://hal.archives-ouvertes.fr/hal-01318072

M. Gadouleau and S. Riis, Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications, IEEE Transactions on Information Theory, vol.57, issue.10, pp.6703-6717, 2011.
DOI : 10.1109/TIT.2011.2155618

B. Guenin and R. Thomas, Packing directed circuits exactly, Combinatorica, vol.27, issue.4, pp.397-421, 2011.
DOI : 10.1287/moor.27.2.361.328
URL : http://arxiv.org/pdf/1012.2749

F. Harary, On the measurement of structural balance, Behavioral Science, vol.11, issue.4, pp.316-323, 1959.
DOI : 10.1080/00223980.1946.9917275

W. Teresa, S. Haynes, P. Hedetniemi, and . Slater, Fundamentals of domination in graphs, 1998.

J. Hopfield, Neural networks and physical systems with emergent collective computational abilities, Proc. Nat. Acad. Sc. U.S.A, pp.2554-2558, 1982.

S. A. Kauffman, Metabolic stability and epigenesis in randomly constructed genetic nets, Journal of Theoretical Biology, vol.22, issue.3, pp.437-467, 1969.
DOI : 10.1016/0022-5193(69)90015-0

S. A. Kauffman, Origins of Order Self-Organization and Selection in Evolution, 1993.

C. Lee, Domination in digraphs, J. Korean Math. Soc, vol.35, issue.4, pp.843-853, 1998.

W. S. Mac-culloch and W. S. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math Bio. Phys, vol.5, pp.113-115, 1943.

W. Mccuaig, Intercyclic digraphs, Contemporary Mathematics, vol.147, pp.203-245, 1993.
DOI : 10.1090/conm/147/01176

B. Reed, N. Robertson, P. Seymour, and R. Thomas, Packing directed circuits, Combinatorica, vol.2, issue.4, pp.535-554, 1996.
DOI : 10.1007/BF01271272

E. Remy, P. Ruet, and D. Thieffry, Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework, Advances in Applied Mathematics, vol.41, issue.3, pp.335-350, 2008.
DOI : 10.1016/j.aam.2007.11.003
URL : https://hal.archives-ouvertes.fr/hal-00692086

S. Riis, Information flows, graphs and their guessing numbers, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, p.44, 2007.
DOI : 10.1109/WIOPT.2006.1666516
URL : http://www.dcs.qmul.ac.uk/~smriis/NetCod06.pdf

F. Robert, Discrete iterations: a metric study, of Series in Computational Mathematics, 1986.
DOI : 10.1007/978-3-642-61607-5

P. D. Seymour, Packing directed circuits fractionally, Combinatorica, vol.2, issue.2, pp.281-288, 1995.
DOI : 10.1007/BF01200760

R. Thomas, Boolean formalization of genetic control circuits, Journal of Theoretical Biology, vol.42, issue.3, pp.563-585, 1973.
DOI : 10.1016/0022-5193(73)90247-6

R. Thomas and R. , Biological Feedback, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00087681

R. Thomas and M. Kaufman, Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits, Chaos: An Interdisciplinary Journal of Nonlinear Science, vol.94, issue.1, pp.180-195, 2001.
DOI : 10.1007/978-3-642-49321-8_11

C. Thomassen, On the presence of disjoint subgraphs of a specified type, Journal of Graph Theory, vol.10, issue.1, pp.101-111, 1988.
DOI : 10.4153/CJM-1965-035-8

T. Zaslavsky, Signed graphs, Discrete Applied Mathematics, vol.4, issue.1, pp.47-74, 1982.
DOI : 10.1016/0166-218X(82)90033-6
URL : https://doi.org/10.1016/0166-218x(83)90047-1

T. Zaslavsky, A mathematical bibliography of signed and gain graphs and allied areas, The Electronic Journal of Combinatorics, vol.1000, p.8, 2012.