{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T20:01:22Z","timestamp":1760731282165,"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>In this paper we consider an oriented version of adjacency graphs of triangulations of bordered surfaces with marked points. We develop an algorithm that determines whether a given oriented graph is an oriented adjacency graph of a triangulation.  If a given oriented graph corresponds to many triangulations, our algorithm finds all of them.  As a corollary we find out that there are only finitely many oriented connected graphs with non-unique associated triangulations.  We also discuss a new algorithm which determines whether a given quiver is of finite mutation type.  This algorithm is linear in the number of nodes and is more effective than the previously known one.<\/jats:p>","DOI":"10.37236\/578","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:48:28Z","timestamp":1578714508000},"source":"Crossref","is-referenced-by-count":4,"title":["A Decomposition Algorithm for the Oriented Adjacency Graph of the Triangulations of a Bordered Surface with Marked Points"],"prefix":"10.37236","volume":"18","author":[{"given":"Weiwen","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,4,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p91\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p91\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:13:07Z","timestamp":1579302787000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/578","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,4,21]]},"article-number":"P91"}}