{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T17:34:43Z","timestamp":1772213683113,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>An antimagic labeling\u00a0of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of\u00a0$D$ to the integers $\\{1, \\cdots, m\\}$ such that all $n$ oriented vertex sums are pairwise distinct,\u00a0where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the\u00a0sum of labels of all arcs leaving it. An undirected graph $G$ is said to\u00a0have an antimagic orientation if $G$ has an orientation which admits an antimagic\u00a0labeling. Hefetz, M\u00fctze, and Schwartz conjectured that\u00a0every connected undirected graph admits an antimagic orientation.\u00a0In this paper, we support this conjecture by proving that every biregular bipartite graph admits an antimagic orientation.<\/jats:p>","DOI":"10.37236\/7276","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:43:06Z","timestamp":1578670986000},"source":"Crossref","is-referenced-by-count":20,"title":["Antimagic Orientation of Biregular Bipartite Graphs"],"prefix":"10.37236","volume":"24","author":[{"given":"Songling","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2017,11,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p31\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i4p31\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:42:14Z","timestamp":1579236134000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i4p31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,10,5]]}},"URL":"https:\/\/doi.org\/10.37236\/7276","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,3]]},"article-number":"P4.31"}}