{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T14:12:57Z","timestamp":1773583977274,"version":"3.50.1"},"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 star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that\u00a0 every path and cycle of length four in $G$\u00a0 uses at least three different colors. The star chromatic index of a graph $G$ is the smallest integer $k$ for which $G$ admits a star edge coloring with $k$ colors.\u00a0 In this paper,\u00a0 we present a polynomial time algorithm that finds an optimum star edge coloring for every tree. We also provide some tight bounds on the star chromatic index of trees with diameter at most four, and using these bounds we find a formula for the star chromatic index of certain families of trees.<\/jats:p>","DOI":"10.37236\/9202","type":"journal-article","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T06:13:18Z","timestamp":1610604798000},"source":"Crossref","is-referenced-by-count":4,"title":["A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees"],"prefix":"10.37236","volume":"28","author":[{"given":"Behnaz","family":"Omoomi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elham","family":"Roshanbin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marzieh","family":"Vahid Dastjerdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2021,1,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p6\/8246","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v28i1p6\/8246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T06:13:19Z","timestamp":1610604799000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v28i1p6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1,14]]}},"URL":"https:\/\/doi.org\/10.37236\/9202","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,15]]},"article-number":"P1.6"}}