{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:52Z","timestamp":1753893772071,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A homomorphism from an oriented graph $G$ to an oriented graph $H$ is a mapping $\\varphi$ from the set of vertices of $G$ to the set of vertices of $H$ such that $\\overrightarrow{\\varphi(u)\\varphi(v)}$ is an arc in $H$ whenever $\\overrightarrow{uv}$ is an arc in $G$. The oriented chromatic index of an oriented graph $G$ is the minimum number of vertices in an oriented graph $H$ such that there exists a homomorphism from the line digraph $LD(G)$ of $G$ to $H$ (Recall that $LD(G)$ is given by $V(LD(G))=A(G)$ and $ \\overrightarrow{ab}\\in A(LD(G))$ whenever $a=\\overrightarrow{uv}$ and $b=\\overrightarrow{vw}$).  We prove that every oriented subcubic graph has oriented chromatic index at most $7$ and construct a subcubic graph with oriented chromatic index $6$.<\/jats:p>","DOI":"10.37236\/1095","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:59:08Z","timestamp":1578718748000},"source":"Crossref","is-referenced-by-count":3,"title":["On Oriented Arc-Coloring of Subcubic Graphs"],"prefix":"10.37236","volume":"13","author":[{"given":"Alexandre","family":"Pinlou","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2006,8,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r69\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r69\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:09:57Z","timestamp":1579320597000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v13i1r69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,7]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2006,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1095","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2006,8,7]]},"article-number":"R69"}}