{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:00:18Z","timestamp":1775718018510,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:00:00Z","timestamp":1770508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:00:00Z","timestamp":1770508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571372"],"award-info":[{"award-number":["12571372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00373-026-03014-y","type":"journal-article","created":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T06:56:57Z","timestamp":1770533817000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Seymour\u2019s second neighborhood conjecture for some oriented graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Haozhe","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9461-0640","authenticated-orcid":false,"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,8]]},"reference":[{"key":"3014_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s000260300001","volume":"7","author":"G Chen","year":"2003","unstructured":"Chen, G., Shen, J., Yuster, R.: Second Neighborhood via First Neighborhood in Digraphs. Ann. Comb. 7, 15\u201320 (2003)","journal-title":"Ann. Comb."},{"issue":"2","key":"3014_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.55016\/ojs\/cdm.v20i2.77499","volume":"20","author":"M Daamouch","year":"2025","unstructured":"Daamouch, M., Ghazal, S., Al-Mniny, D.: About the Second Neighborhood Conjecture for Tournaments Missing Two Stars or Disjoint Paths. Contrib. Discret. Math. 20(2), 363\u2013383 (2025)","journal-title":"Contrib. Discret. Math."},{"key":"3014_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2021.12.034","volume":"311","author":"S Dara","year":"2022","unstructured":"Dara, S., Francis, M.C., Jacob, D., Narayanan, N.: Extending some results on the second neighborhood conjecture. Discret. Appl. Math. 311, 1\u201317 (2022)","journal-title":"Discret. Appl. Math."},{"key":"3014_CR4","first-page":"73","volume":"109","author":"N Dean","year":"1995","unstructured":"Dean, N., Latka, B.J.: Squaring the tournament-an open problem. Congr. Numer. 109, 73\u201380 (1995)","journal-title":"Congr. Numer."},{"issue":"3","key":"3014_CR5","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1002\/jgt.20229","volume":"55","author":"D Fidler","year":"2007","unstructured":"Fidler, D., Yuster, R.: Remarks on the Second Neighborhood Problem. J. Graph Theory 55(3), 208\u2013220 (2007)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3014_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/(SICI)1097-0118(199609)23:1<43::AID-JGT4>3.0.CO;2-K","volume":"23","author":"DC Fisher","year":"1996","unstructured":"Fisher, D.C.: Squaring a Tournament: A Proof of Dean\u2019s Conjecture. J. Graph Theory 23(1), 43\u201348 (1996)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3014_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/jgt.20634","volume":"71","author":"S Ghazal","year":"2012","unstructured":"Ghazal, S.: Seymour\u2019s Second Neighborhood Conjecture for Tournaments Missing a Generalized Star. J. Graph Theory 71(1), 89\u201394 (2012)","journal-title":"J. Graph Theory"},{"issue":"5","key":"3014_CR8","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s00373-012-1192-9","volume":"29","author":"S Ghazal","year":"2013","unstructured":"Ghazal, S.: A Contribution to the Second Neighborhood Problem. Graphs and Combinatorics 29(5), 1365\u20131375 (2013)","journal-title":"Graphs and Combinatorics"},{"issue":"2","key":"3014_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.5614\/ejgta.2015.3.2.6","volume":"3","author":"S Ghazal","year":"2015","unstructured":"Ghazal, S.: A remark on the second neighborhood problem. Electron. J. Graph Theory Appl. 3(2), 182\u2013190 (2015)","journal-title":"Electron. J. Graph Theory Appl."},{"issue":"4","key":"3014_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1002\/1097-0118(200012)35:4<244::AID-JGT2>3.0.CO;2-H","volume":"35","author":"F Havet","year":"2000","unstructured":"Havet, F., Thomass\u00e9, S.: Median orders of tournaments: A tool for the second neighborhood problem and Sumner\u2019s conjecture. J. Graph Theory 35(4), 244\u2013256 (2000)","journal-title":"J. Graph Theory"},{"key":"3014_CR11","unstructured":"Huang, H., Peng, F.: An improved bound on Seymour\u2019s second neighborhood conjecture. arXiv:2412.20234 (2024)"},{"key":"3014_CR12","first-page":"201","volume":"148","author":"Y Kaneko","year":"2001","unstructured":"Kaneko, Y., Locke, S.C.: The minimum degree approach for Paul Seymour\u2019s distance 2 conjecture. Congr. Numer. 148, 201\u2013206 (2001)","journal-title":"Congr. Numer."},{"issue":"1","key":"3014_CR13","first-page":"58","volume":"81","author":"DA Mniny","year":"2021","unstructured":"Mniny, D.A., Ghazal, S.: The second neighborhood conjecture for oriented graphs missing $$\\{C_{4}, \\overline{C_{4}}, S_{3},$$ chair and co-chair$$\\}$$-free graph. Australas. J. Comb. 81(1), 58\u201388 (2021)","journal-title":"Australas. J. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03014-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03014-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03014-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:16:21Z","timestamp":1775715381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03014-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,8]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3014"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03014-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,8]]},"assertion":[{"value":"13 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"19"}}