References
Here you will find a list of all references cited in the paper.
| Author | Title | Journal | Year | Volume | Pages |
|---|---|---|---|---|---|
| Brantner, J.; Brockman, G., Kay, B., Snively, E. | Contributions to Seymour's Second Neighborhood Conjecture | Involve | 2008 | 2 | |
| Botler, Moura, and Naia | Seymour's Second Neighborhood Conjecture for orientations of (pseudo)random graphs | Discrete Mathematics | 2023 | 346 | 12 |
| Chen, G.; Shen, J.; Yuster, R. | Second neighborhood via first neighborhood in digraphs | Annals of Combinatorics | 2003 | 7 | 15-20 |
| Dean, N. ; Latka, B. | Squaring the tournament-an open problem | Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics | 1995 | 109 | |
| Seymour's Second Neighborhood Conjecture: Random Graphs and Reductions | arXiv preprint | 2024 | 0 | ||
| Dietsel, R | Graph Theory, 5th ed. Berlin, Germany | Springer | 2017 | 0 | |
| Fisher, David C | Squaring a tournament: a proof of Dean's conjecture | J. Graph Theory | 1996 | 1 | 43--48 |
| Glover, C. | Solving the Degree-Seven Case of the Seymour Second Neighbor Conjecture | Journal of Graph Theory, Manuscript submitted for publication | 2024 | 0 | |
| Garey, M; Johnson D. | Computers and Intractability: A Guide to the Theory of NP-Completeness | W. H. Freeman | 1979 | 0 | |
| Median orders of tournaments: a tool for the second neighborhood problem and Sumner's conjecture. | J. Graph Theory | 2000 | 4 | 244--256 | |
| Kaneko,Y.; Locke,S. | The minimum degree approach for Paul Seymour's distance 2 conjecture. | Congressus Numerantium | 2001 | 0 | |
| Daamouch, M | Discrete Applied Mathematics | 2021 | 304 | 333-341 |