K. Bala and T. Stern, Algorithms for routing in a linear lightwave network, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings, pp.1-9, 1991.
DOI : 10.1109/INFCOM.1991.147477

J. Bermond, M. Cosnard, and S. Pérennes, Directed acyclic graphs with unique path property, 2009.
DOI : 10.1016/j.tcs.2012.06.015
URL : https://hal.archives-ouvertes.fr/hal-00869501/file/tcs270412.pdf

P. Bonsma, Sparse cuts, matching-cuts and leafy trees in graphs, p.57117, 2006.

P. Bonsma, The complexity of the matching-cut problem for planar graphs and other graph classes, Journal of Graph Theory, vol.247, issue.1-3, pp.109-126, 2009.
DOI : 10.1002/jgt.20390

P. Bonsma, A. M. Farley, and A. Proskurowski, Extremal graphs having no matching cuts, Journal of Graph Theory, vol.7, issue.5, 2011.
DOI : 10.1002/jgt.20576

N. Eaton and T. Hull, Defective list colorings of planar graphs, Bull. Inst. Combin. Appl, vol.25, pp.79-87, 1999.

A. Farley and A. Proskurowski, Extremal graphs with no disconnecting matching, Proceedings of the second West Coast conference on combinatorics , graph theory, and computing, pp.153-165, 1984.

Z. Füredi, New Asymptotics for Bipartite Tur??n Numbers, Journal of Combinatorial Theory, Series A, vol.75, issue.1, pp.141-144, 1996.
DOI : 10.1006/jcta.1996.0067

R. Ramaswami and K. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE/ACM Transactions on Networking, vol.3, issue.5, pp.489-500, 1995.
DOI : 10.1109/90.469957

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350