{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:17Z","timestamp":1753893797603,"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>Let $\\theta(a_1,a_2,\\cdots,a_k)$ denote the graph obtained by connecting two distinct vertices with $k$ independent paths of lengths $a_1,a_2,$ $\\cdots,a_k$ respectively. Assume that $2\\le a_1\\le a_2\\le \\cdots \\le a_k$. We prove that the graph $\\theta(a_1,a_2, \\cdots,a_k)$ is chromatically unique if $a_k &lt;  a_1+a_2$, and find examples showing that $\\theta(a_1,a_2, \\cdots,a_k)$ may not be chromatically unique if $a_k=a_1+a_2$.<\/jats:p>","DOI":"10.37236\/1765","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:23:33Z","timestamp":1578720213000},"source":"Crossref","is-referenced-by-count":5,"title":["Chromatically Unique Multibridge Graphs"],"prefix":"10.37236","volume":"11","author":[{"given":"F. M.","family":"Dong","sequence":"first","affiliation":[]},{"given":"K. L.","family":"Teo","sequence":"additional","affiliation":[]},{"given":"C. H. C.","family":"Little","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hendy","sequence":"additional","affiliation":[]},{"given":"K. M.","family":"Koh","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2004,1,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v11i1r12\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v11i1r12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:04:52Z","timestamp":1579323892000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v11i1r12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2004,1,2]]}},"URL":"https:\/\/doi.org\/10.37236\/1765","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2004,1,23]]},"article-number":"R12"}}