{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:44:58Z","timestamp":1747154698645,"version":"3.40.5"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1016\/j.amc.2024.128755","type":"journal-article","created":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T09:44:49Z","timestamp":1713865489000},"page":"128755","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Vertex degree sums for supereulerian bipartite digraphs"],"prefix":"10.1016","volume":"475","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6688-7545","authenticated-orcid":false,"given":"Jiaqi","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-5643","authenticated-orcid":false,"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2024.128755_br0090","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jgt.21885","article-title":"Supereulerian digraphs with large arc-strong connectivity","volume":"81","author":"Algefari","year":"2016","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0110","first-page":"289","article-title":"Supereulerian digraphs with forbidden induced subdigraphs containing short dipaths","volume":"147","author":"Algefari","year":"2019","journal-title":"Ars Comb."},{"year":"2008","series-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen","key":"10.1016\/j.amc.2024.128755_br0060"},{"key":"10.1016\/j.amc.2024.128755_br0080","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1002\/jgt.21810","article-title":"Sufficient conditions for a digraph to be supereulerian","volume":"79","author":"Bang-Jensen","year":"2015","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0020","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jgt.3190010115","article-title":"The spanning subgraphs of Eulerian graphs","volume":"1","author":"Boesch","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0010","first-page":"2151","article-title":"Chemins et circuits hamiltoniens des graphes complets","volume":"249","author":"Camion","year":"1959","journal-title":"C. R. Hebd. S\u00e9ances Acad. Sci."},{"key":"10.1016\/j.amc.2024.128755_br0050","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jgt.3190160209","article-title":"Supereulerian graphs: a survey","volume":"16","author":"Catlin","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0120","article-title":"Sufficient ore type condition for a digraph to be supereulerian","volume":"410","author":"Dong","year":"2021","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2024.128755_br0070","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disc.2014.04.018","article-title":"Supereulerian digraphs","volume":"330","author":"Hong","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2024.128755_br0130","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/jgt.22860","article-title":"Supereulerian regular matroids without small cocircuits","volume":"102","author":"Huo","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0040","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/jgt.3190120103","article-title":"Contractions and Hamiltonian line graphs","volume":"12","author":"Lai","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0030","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/jgt.3190030316","article-title":"A note on graphs spanned by Eulerian graphs","volume":"3","author":"Pulleyblank","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.amc.2024.128755_br0100","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1002\/jgt.22240","article-title":"Supereulerian bipartite digraphs","volume":"89","author":"Zhang","year":"2018","journal-title":"J. Graph Theory"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032400225X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032400225X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T20:36:23Z","timestamp":1719002183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009630032400225X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":13,"alternative-id":["S009630032400225X"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2024.128755","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Vertex degree sums for supereulerian bipartite digraphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2024.128755","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"128755"}}