{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:39:17Z","timestamp":1775716757831,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["252300421488"],"award-info":[{"award-number":["252300421488"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postgraduate Education Reform and Quality Improvement Project of Henan Province","award":["YJS2024KC32"],"award-info":[{"award-number":["YJS2024KC32"]}]},{"name":"Henan Normal University Research and Practical Innovation Project"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00373-025-02959-w","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T06:14:05Z","timestamp":1755065645000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Diameter Three Orientability of Mixed Bipartite Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Hengzhe","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhiwei","family":"Ding","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6004-971X","authenticated-orcid":false,"given":"Jianbing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"An","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,13]]},"reference":[{"issue":"4","key":"2959_CR1","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1002\/jgt.22941","volume":"103","author":"J Babu","year":"2023","unstructured":"Babu, J., Benson, D., Rajendraprasad, D.: Improved bounds for the oriented radius of mixed multigraphs. J. Graph Theory 103(4), 674\u2013689 (2023)","journal-title":"J. Graph Theory"},{"key":"2959_CR2","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejc.2015.03.003","volume":"49","author":"S Bau","year":"2015","unstructured":"Bau, S., Dankelmann, P.: Diameter of orientations of graphs with given minimum degree. Eur. J. Combin. 49, 126\u2013133 (2015)","journal-title":"Eur. J. Combin."},{"key":"2959_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. GTM 244, Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"1","key":"2959_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0095-8956(78)90078-3","volume":"24","author":"V Chv\u00e1tal","year":"1978","unstructured":"Chv\u00e1tal, V., Thomassen, C.: Distances in orientations of graphs. J. Combin. Theory Ser. B 24(1), 61\u201375 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2959_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.37236\/9723","volume":"28","author":"B Chen","year":"2021","unstructured":"Chen, B., Chang, A.: Diameter three orientability of bipartite graphs. Electron. J. Combin. 28(2), 25 (2021)","journal-title":"Electron. J. Combin."},{"issue":"4","key":"2959_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113287","volume":"346","author":"B Chen","year":"2023","unstructured":"Chen, B., Chang, A.: Oriented diameter of graphs with given girth and maximum degree. Discrete Math. 346(4), 113287 (2023)","journal-title":"Discrete Math."},{"issue":"4","key":"2959_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1002\/net.3230150409","volume":"15","author":"FRK Chung","year":"1985","unstructured":"Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477\u2013484 (1985)","journal-title":"Networks"},{"issue":"4","key":"2959_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113846","volume":"347","author":"G Cochran","year":"2024","unstructured":"Cochran, G.: Large girth and small oriented diameter graphs. Discrete Math. 347(4), 113846 (2024)","journal-title":"Discrete Math."},{"key":"2959_CR9","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/j.disc.2018.12.012","volume":"342","author":"\u00c9 Czabarka","year":"2019","unstructured":"Czabarka, \u00c9., Dankelmann, P., Sz\u00e9kely, L.A.: A degree condition for diameter two orientability of graphs. Discrete Math. 342, 1063\u20131065 (2019)","journal-title":"Discrete Math."},{"issue":"1","key":"2959_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s00373-023-02741-w","volume":"40","author":"P Dankelmann","year":"2024","unstructured":"Dankelmann, P., Morgan, J., Rivett-Carnac, E.: The oriented diameter of graphs with given connected domination number and distance domination number. Graphs Combin. 40(1), 18 (2024)","journal-title":"Graphs Combin."},{"issue":"1","key":"2959_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22181","volume":"88","author":"P Dankelmann","year":"2018","unstructured":"Dankelmann, P., Guo, Y., Surmacs, M.: Oriented diameter of graphs with given maximum degree. J. Graph Theory 88(1), 5\u201317 (2018)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2959_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(03)00376-7","volume":"141","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Matamala, M., Prisner, E., Rapaport, I.: AT-free graphs: linear bounds for the oriented diameter. Discrete Appl. Math. 141(1), 135\u2013148 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"2959_CR13","first-page":"101","volume":"5","author":"G Gutin","year":"1989","unstructured":"Gutin, G.: $$M$$-sources in complete multipartite graphs. Ser. Fiz.-Mat. Navuk. 5(5), 101\u2013106 (1989). (in Russian)","journal-title":"Ser. Fiz.-Mat. Navuk."},{"issue":"3","key":"2959_CR14","first-page":"51","volume":"16","author":"X Huang","year":"2014","unstructured":"Huang, X., Li, H., Li, X., Sun, Y.: Oriented diameter and rainbow connection number of a graph. Discrete Mat. Theor. Comput. Sci. 16(3), 51\u201360 (2014)","journal-title":"Discrete Mat. Theor. Comput. Sci."},{"key":"2959_CR15","first-page":"362","volume":"2","author":"G Katona","year":"1967","unstructured":"Katona, G., Szemer\u00e9di, E.: On a problem of graph theory. Studia Sci. Math. Hungar. 2, 362\u2013371 (1967)","journal-title":"Studia Sci. Math. Hungar."},{"key":"2959_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.dam.2021.01.025","volume":"319","author":"KSA Kumar","year":"2022","unstructured":"Kumar, K.S.A., Rajendraprasad, D., Sudeep, K.S.: Oriented diameter of star graphs. Discrete Appl. Math. 319, 362\u2013371 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2959_CR17","first-page":"109","volume":"14","author":"S Kurz","year":"2012","unstructured":"Kurz, S., L\u00e4tsch, M.: Bounds for the minimum oriented diameter. Discrete Math. Theor. Comput. Sci. 14(1), 109\u2013140 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"2959_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jctb.2009.08.003","volume":"100","author":"PK Kwok","year":"2010","unstructured":"Kwok, P.K., Liu, Q., West, D.B.: Oriented diameter of graphs with diameter 3. J. Combin. Theory Ser. B 100(3), 265\u2013274 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2959_CR19","unstructured":"Li, H., Ding, Z., Liu, J., Gao, Y., Zhao, S.: A note on improved bounds for the oriented radius of mixed multigraphs. arXiv:2407.01612"},{"key":"2959_CR20","unstructured":"Li, H., Ding, Z., Liu, J., Lai, H.-J.: Diameter two orientability of mixed graphs. arXiv:2408.10809"},{"issue":"5","key":"2959_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10878-024-01177-z","volume":"47","author":"D Mondal","year":"2024","unstructured":"Mondal, D., Parthiban, N., Rajasingh, I.: On the oriented diameter of planar triangulations. J. Combin. Optim. 47(5), 79 (2024)","journal-title":"J. Combin. Optim."},{"issue":"5","key":"2959_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs with an application to a problem of traffic control. Am. Math. Mon. 46(5), 281\u2013283 (1939)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"2959_CR23","first-page":"289","volume":"36","author":"L \u0160olt\u00e9s.","year":"1986","unstructured":"\u0160olt\u00e9s., L.: Orientations of graphs minimizing the radius of the diameter. Math. Slovaca 36(3), 289\u2013296 (1986)","journal-title":"Math. Slovaca"},{"key":"2959_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejc.2016.08.006","volume":"59","author":"M Surmacs","year":"2017","unstructured":"Surmacs, M.: Improved bound on the oriented diameter of graphs with given minimum degree. Eur. J. Combin. 59, 187\u2013191 (2017)","journal-title":"Eur. J. Combin."},{"key":"2959_CR25","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1002\/jgt.22707","volume":"98","author":"X Wang","year":"2021","unstructured":"Wang, X., Chen, Y., Dankelmann, P., Guo, Y., Surmacs, M., Volkmann, L.: Oriented diameter of maximal outerplanar graphs. J. Graph Theory 98, 426\u2013444 (2021)","journal-title":"J. Graph Theory"},{"key":"2959_CR26","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.jctb.2022.03.003","volume":"155","author":"X Wang","year":"2022","unstructured":"Wang, X., Chen, Y.: Optimal oriented diameter of graphs with diameter 3. J. Combin. Theory Ser. B 155, 374\u2013388 (2022)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02959-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02959-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02959-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:19Z","timestamp":1760505079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02959-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2959"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02959-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,13]]},"assertion":[{"value":"2 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"95"}}