{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T08:40:02Z","timestamp":1733474402277,"version":"3.30.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:p> We characterize planar graphs and graph minors among other graph theoretic notions in terms of right-angled Artin groups (RAAGs). For this, we determine all sets of elements in RAAGs with ears as underlying graphs that are exactly the sets of vertex generators. Generalizing ear decompositions of graphs to loose ear decompositions, we characterize both decompositions in terms of RAAGs. The desired results follow as applications of loose ear decompositions of RAAGs. <\/jats:p>","DOI":"10.1142\/s0218196724500449","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T07:45:29Z","timestamp":1724399129000},"page":"1111-1129","source":"Crossref","is-referenced-by-count":0,"title":["Loose ear decompositions and their applications to right-angled Artin groups"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3755-101X","authenticated-orcid":false,"given":"Max","family":"Gheorghiu","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of British Columbia, 125-1984 Mathematics Road, Vancouver, British Columbia, Canada V6T 1Z2"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,9,24]]},"reference":[{"doi-asserted-by":"publisher","key":"S0218196724500449BIB002","DOI":"10.1007\/978-3-662-53622-3"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB003","DOI":"10.1016\/0890-5401(92)90041-D"},{"key":"S0218196724500449BIB005","series-title":"Textbooks in Mathematics","volume-title":"Graph Theory and its Applications","author":"Gross J. L.","year":"2019","edition":"3"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB007","DOI":"10.1109\/SFCS.1991.185452"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB008","DOI":"10.1007\/978-3-030-97560-9_15"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB009","DOI":"10.1007\/BF01389191"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB010","DOI":"10.1137\/15M1030030"},{"key":"S0218196724500449BIB011","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"24","author":"Schrijver A.","year":"2004"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB012","DOI":"10.1016\/0021-8693(89)90319-0"},{"doi-asserted-by":"publisher","key":"S0218196724500449BIB013","DOI":"10.1007\/BFb0096068"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196724500449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T08:12:35Z","timestamp":1733472755000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218196724500449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,24]]},"references-count":10,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1142\/S0218196724500449"],"URL":"https:\/\/doi.org\/10.1142\/s0218196724500449","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"type":"print","value":"0218-1967"},{"type":"electronic","value":"1793-6500"}],"subject":[],"published":{"date-parts":[[2024,9,24]]}}}