{"id":"https://openalex.org/W7155365840","doi":"https://doi.org/10.5614/ejgta.2026.14.1.15","title":"Decompositions and packings in truncated triangulations","display_name":"Decompositions and packings in truncated triangulations","publication_year":2026,"publication_date":"2026-04-22","ids":{"openalex":"https://openalex.org/W7155365840","doi":"https://doi.org/10.5614/ejgta.2026.14.1.15"},"language":"en","primary_location":{"id":"doi:10.5614/ejgta.2026.14.1.15","is_oa":true,"landing_page_url":"https://doi.org/10.5614/ejgta.2026.14.1.15","pdf_url":"http://ejgta.org/index.php/ejgta/article/download/2001/pdf_358","source":{"id":"https://openalex.org/S4210230765","display_name":"Electronic Journal of Graph Theory and Applications","issn_l":"2338-2287","issn":["2338-2287"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315132","host_organization_name":"Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr","host_organization_lineage":["https://openalex.org/P4310315132"],"host_organization_lineage_names":["Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Journal of Graph Theory and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://ejgta.org/index.php/ejgta/article/download/2001/pdf_358","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134422796","display_name":"Michael Muzheve","orcid":null},"institutions":[{"id":"https://openalex.org/I181414168","display_name":"Texas A&M University \u2013 Kingsville","ror":"https://ror.org/05abs3w97","country_code":"US","type":"education","lineage":["https://openalex.org/I181414168"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Muzheve","raw_affiliation_strings":["Texas A&M University - Kingsville"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&M University - Kingsville","institution_ids":["https://openalex.org/I181414168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5134422796"],"corresponding_institution_ids":["https://openalex.org/I181414168"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51855021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"1","first_page":"231","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4828999936580658,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4828999936580658,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.22040000557899475,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.10689999908208847,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7458000183105469},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5605000257492065},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46470001339912415},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.44519999623298645},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.43560001254081726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41530001163482666},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.34769999980926514},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.33719998598098755}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8108999729156494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7781000137329102},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7458000183105469},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5605000257492065},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46470001339912415},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41530001163482666},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.34769999980926514},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33250001072883606},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.3314000070095062},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.33090001344680786},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.322299987077713},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.2524000108242035},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5614/ejgta.2026.14.1.15","is_oa":true,"landing_page_url":"https://doi.org/10.5614/ejgta.2026.14.1.15","pdf_url":"http://ejgta.org/index.php/ejgta/article/download/2001/pdf_358","source":{"id":"https://openalex.org/S4210230765","display_name":"Electronic Journal of Graph Theory and Applications","issn_l":"2338-2287","issn":["2338-2287"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315132","host_organization_name":"Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr","host_organization_lineage":["https://openalex.org/P4310315132"],"host_organization_lineage_names":["Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Journal of Graph Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:37a796acb40e4e02ac6ea852562cfd39","is_oa":true,"landing_page_url":"https://doaj.org/article/37a796acb40e4e02ac6ea852562cfd39","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Journal of Graph Theory and Applications, Vol 14, Iss 1, Pp 231-244 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.5614/ejgta.2026.14.1.15","is_oa":true,"landing_page_url":"https://doi.org/10.5614/ejgta.2026.14.1.15","pdf_url":"http://ejgta.org/index.php/ejgta/article/download/2001/pdf_358","source":{"id":"https://openalex.org/S4210230765","display_name":"Electronic Journal of Graph Theory and Applications","issn_l":"2338-2287","issn":["2338-2287"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315132","host_organization_name":"Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr","host_organization_lineage":["https://openalex.org/P4310315132"],"host_organization_lineage_names":["Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Austr"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Journal of Graph Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7155365840.pdf","grobid_xml":"https://content.openalex.org/works/W7155365840.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,21,92],"study":[1],"decompositions":[2],"and":[3,43,52,87,99,136],"packings":[4],"in":[5,90],"truncated":[6,115],"triangulations":[7],"G":[8,16,23,55,62,67,106,123,133,141],"T\u25b3":[9,24,63,107,134],"obtained":[10],"from":[11],"simple":[12],"connected":[13],"plane":[14,120],"graphs":[15],"with":[17,31,70],"minimum":[18],"degree":[19],"two.":[20],"show":[22,60],"is":[25,56,64,68,89],"a":[26,41,48,71,95,114,118,125],"3-connected":[27],"cubic":[28,119],"planar":[29],"graph":[30,122],"at":[32],"least":[33],"2|E(G)|\u00b2":[34],"-":[35],"2|E(G)|":[36],"+":[37],"1":[38],"perfect":[39],"matchings,":[40],"\u039b-factor,":[42],"can":[44],"be":[45],"decomposed":[46],"into":[47],"union":[49],"of":[50,85,105,117,132],"C\u2086's":[51],"K\u2082's":[53],"if":[54,66,135,138],"bipartite.":[57],"Additionally,":[58],"we":[59],"that":[61,113,128],"hamiltonian":[65,126],"bipartite":[69,121],"dominating":[72],"path":[73],"P":[74],"satisfying,":[75],"for":[76,102],"any":[77],"e":[78],"=":[79],"xy":[80],"\u2209":[81],"E(P)":[82],"exactly":[83],"one":[84],"x":[86],"y":[88],"V(P).":[91],"also":[93],"prove":[94],"result":[96],"giving":[97],"necessary":[98],"sufficient":[100],"conditions":[101],"the":[103,139],"hamiltonicity":[104],".":[108],"Additional":[109],"results":[110],"include":[111],"showing":[112],"triangulation":[116,140],"has":[124,143],"cycle":[127],"separates":[129],"specific":[130],"faces":[131],"only":[137],"\u25b3":[142],"an":[144],"A-trail.":[145]},"counts_by_year":[],"updated_date":"2026-04-25T06:01:18.069262","created_date":"2026-04-24T00:00:00"}