1. Algorithms for routing in a linear lightwave network;Bala,1991
2. J.-C. Bermond, M. Cosnard, S. Pérennes, Directed acyclic graphs with unique path property. Tech. Rep. RR-6932, INRIA, 2009.
3. P. Bonsma, Sparse cuts, matching-cuts and leafy trees in graphs, Ph.D. Thesis, University of Twente, Enschede, the Netherlands, 2006. URL: http://purl.org/utwente/57117.
4. The complexity of the matching-cut problem for planar graphs and other graph classes;Bonsma;J. Graph Theory,2009
5. Extremal graphs having no matching cuts;Bonsma;J. Graph Theory,2011