References
- J. Bang-Jensen, J. Huang and E. Prisner, In-tournaments, J. Combin. Theory Ser. B, 59 (1993), 267–287.
- J. Bang-Jensen, M.H. Nielsen and A. Yeo, Longest path partitions in generalizations of tournaments, Discrete Math., 306 (2006), 1830–1839.
- C. Berge, Graphs, North-Holland, Amsterdam, (1985).
- M. Frick, S. Van Aardt, G. Dlamini, J. Dunbar and O. Oellermann, The directed path partition conjecture, Discussiones Mathematicae Graph Theory, 25 (2005), 331–343.
- H. Galeana-Sánchez, On independent sets and non-augmentable paths in directed graphs, Discuss. Math. Graph Theory, 18 (1998), 171–181.
- H. Galeana-Sánchez and R. Gómez, Independent sets and non-augmentable paths in generalization of tournaments, Discrete Math., 308M (2008), 2460–2472.
- H. Galeana-Sánchez, R. Gómez and J.J. Montellano, Independent transversals of longest paths in locally semicomplete and locally transitive digraphs, Discuss. Math. Graph Theory, 29 (2009), 469–480.
- H. Galeana-Sánchez and H.A. Rincón-Mejía, Independent sets which meet all longest paths, Discrete Math., 152 (1996), 141–145.
- F. Havet, Stable set meeting every longest path, Discrete Math., 289 (2004), 169–173.
- J.M. Laborde, C. Payan, N.H. Xuong, Independent sets and longest paths in digraphs, Graphs and other combinatorial topics, Proceedings of the Third Czechoslovak Symposium of Graph Theory, (1982), 173–177.