{"id":"https://openalex.org/W4390701665","doi":"https://doi.org/10.1137/22m1524047","title":"The Treewidth and Pathwidth of Graph Unions","display_name":"The Treewidth and Pathwidth of Graph Unions","publication_year":2024,"publication_date":"2024-01-10","ids":{"openalex":"https://openalex.org/W4390701665","doi":"https://doi.org/10.1137/22m1524047"},"language":"en","primary_location":{"id":"doi:10.1137/22m1524047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1524047","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://wrap.warwick.ac.uk/182296/1/WRAP-treewidth-pathwidth-graph-unions-23.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021958252","display_name":"Bogdan Alecu","orcid":"https://orcid.org/0000-0002-5515-9145"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bogdan Alecu","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081581015","display_name":"Vadim Lozin","orcid":"https://orcid.org/0000-0003-2464-7389"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Vadim V. Lozin","raw_affiliation_strings":["Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084351080","display_name":"Daniel A. Quiroz","orcid":"https://orcid.org/0000-0002-2479-0508"},"institutions":[{"id":"https://openalex.org/I79274474","display_name":"University of Valpara\u00edso","ror":"https://ror.org/00h9jrb69","country_code":"CL","type":"education","lineage":["https://openalex.org/I79274474"]}],"countries":["CL"],"is_corresponding":true,"raw_author_name":"Daniel A. Quiroz","raw_affiliation_strings":["Instituto de Ingenier\u00eda Matem\u00e1tica-CIMFAV, Universidad de Valparaiso, Valparaiso, Chile"],"raw_orcid":"https://orcid.org/0000-0002-2479-0508","affiliations":[{"raw_affiliation_string":"Instituto de Ingenier\u00eda Matem\u00e1tica-CIMFAV, Universidad de Valparaiso, Valparaiso, Chile","institution_ids":["https://openalex.org/I79274474"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073512540","display_name":"Roman Rabinovich","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133997","display_name":"Pathodiagnostik Berlin","ror":"https://ror.org/034c6t134","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210133997"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Rabinovich","raw_affiliation_strings":["ArangoDB Inc., Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ArangoDB Inc., Berlin, Germany","institution_ids":["https://openalex.org/I4210133997"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068912124","display_name":"Igor Razgon","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Igor Razgon","raw_affiliation_strings":["Department of Computer Science and Information Systems, Birkbeck University of London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Systems, Birkbeck University of London, London, UK","institution_ids":["https://openalex.org/I98259816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047948708","display_name":"Viktor Zamaraev","orcid":"https://orcid.org/0000-0001-5755-4141"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Viktor Zamaraev","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5084351080"],"corresponding_institution_ids":["https://openalex.org/I79274474"],"apc_list":null,"apc_paid":null,"fwci":0.6914,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68457356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"38","issue":"1","first_page":"261","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9987999796867371,"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/T11476","display_name":"Graph theory and applications","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/treewidth","display_name":"Treewidth","score":0.926990807056427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7997348308563232},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7626725435256958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7602465748786926},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7045356631278992},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6638113260269165},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5890200138092041},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5794185400009155},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5363830924034119},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5183178186416626},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4891367256641388},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4618384540081024},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4538423418998718},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38469815254211426},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15645596385002136}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.926990807056427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7997348308563232},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7626725435256958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7602465748786926},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7045356631278992},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6638113260269165},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5890200138092041},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5794185400009155},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5363830924034119},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5183178186416626},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4891367256641388},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4618384540081024},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4538423418998718},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38469815254211426},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15645596385002136},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/22m1524047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1524047","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:182296","is_oa":true,"landing_page_url":null,"pdf_url":"https://wrap.warwick.ac.uk/182296/1/WRAP-treewidth-pathwidth-graph-unions-23.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:durham-repository.worktribe.com:2874720","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/2874720","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:wrap.warwick.ac.uk:182296","is_oa":true,"landing_page_url":null,"pdf_url":"https://wrap.warwick.ac.uk/182296/1/WRAP-treewidth-pathwidth-graph-unions-23.pdf","source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4035456621","display_name":"GRAPH THEORY INTERPLAY BETWEEN CHROMATIC AND STRUCTURAL PROPERTIES","funder_award_id":"11201251","funder_id":"https://openalex.org/F4320331146","funder_display_name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo"},{"id":"https://openalex.org/G5244743123","display_name":null,"funder_award_id":"11201251","funder_id":"https://openalex.org/F4320338073","funder_display_name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320331146","display_name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","ror":null},{"id":"https://openalex.org/F4320338073","display_name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","ror":"https://ror.org/02ap3w078"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390701665.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W2010042187","https://openalex.org/W2033405938","https://openalex.org/W2052867211","https://openalex.org/W2059372025","https://openalex.org/W2087911394","https://openalex.org/W2087966263","https://openalex.org/W2094917705","https://openalex.org/W2762850984","https://openalex.org/W3037826211","https://openalex.org/W4245608944"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W1874754796","https://openalex.org/W143512583","https://openalex.org/W4285428820","https://openalex.org/W2111290740"],"abstract_inverted_index":{".Given":[0],"two":[1],"\\(n\\)-vertex":[2,13,92],"graphs":[3],"\\(G_1\\)":[4,23,49,79,102],"and":[5,24,54,83,103],"\\(G_2\\)":[6,55,84,104],"of":[7,16,66,94,108],"bounded":[8,17],"treewidth,":[9],"is":[10,29,45,50,56,71,90],"there":[11,89],"an":[12,63,91],"graph":[14,93],"\\(G\\)":[15],"treewidth":[18,81,95],"having":[19],"subgraphs":[20],"isomorphic":[21],"to":[22,33],"\\(G_2\\)?":[25],"Our":[26],"main":[27],"result":[28],"a":[30,37,51,57],"negative":[31],"answer":[32,44],"this":[34],"question,":[35],"in":[36],"strong":[38],"sense:":[39],"we":[40,75],"show":[41],"that":[42,77],"the":[43],"no":[46],"even":[47],"if":[48,78],"binary":[52],"tree":[53],"ternary":[58],"tree.":[59],"We":[60],"also":[61],"provide":[62],"extensive":[64],"study":[65],"cases":[67],"where":[68],"such":[69],"\"gluing\"":[70],"possible.":[72],"In":[73],"particular,":[74],"prove":[76],"has":[80,85],"\\(k\\)":[82],"pathwidth":[86],"\\(\\ell\\),":[87],"then":[88],"at":[96],"most":[97],"\\(k+3":[98],"\\ell+1\\)":[99],"containing":[100],"both":[101],"as":[105],"subgraphs.Keywordstreewidthpathwidthgraph":[106],"uniongluing":[107],"graphsMSC":[109],"codes05C7605C7805C83":[110]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
