{"id":"https://openalex.org/W7128514015","doi":"https://doi.org/10.48550/arxiv.2602.07607","title":"Determining the Outerthickness of Graphs Is NP-Hard","display_name":"Determining the Outerthickness of Graphs Is NP-Hard","publication_year":2026,"publication_date":"2026-02-07","ids":{"openalex":"https://openalex.org/W7128514015","doi":"https://doi.org/10.48550/arxiv.2602.07607"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.137","is_oa":true,"landing_page_url":"https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3735","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3735","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125540713","display_name":"Pin-Hsian Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Pin-Hsian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125529812","display_name":"Te-Cheng Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Te-Cheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064418445","display_name":"Meng-Tsung Tsai","orcid":"https://orcid.org/0000-0002-2243-8666"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tsai, Meng-Tsung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17574164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8970000147819519,"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.8970000147819519,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.033799998462200165,"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.025800000876188278,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.4745999872684479},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.43209999799728394},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4278999865055084},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.42399999499320984},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.40369999408721924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3889999985694885},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38449999690055847},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.36239999532699585},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.35420000553131104}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8075000047683716},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.717199981212616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6096000075340271},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.4745999872684479},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.40369999408721924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38449999690055847},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3262999951839447},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2903999984264374},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2863999903202057},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.2847000062465668},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.26330000162124634},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2612999975681305},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.icalp.2026.137","is_oa":true,"landing_page_url":"https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3735","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:doi:10.48550/arxiv.2602.07607","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.07607","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.07607","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.icalp.2026.137","is_oa":true,"landing_page_url":"https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3735","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.4457433521747589}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,14,21,37,47,167],"short,":[3],"self-contained,":[4],"and":[5,62,124,142,163],"easily":[6],"verifiable":[7],"proof":[8],"that":[9,82,90,131,143,239,307],"determining":[10,206],"the":[11,26,66,71,100,147,172,189,198,203,212,225,231,242,251,264,276,292,310],"outerthickness":[12],"of":[13,29,102,146,169,191,205,214,241,253,266,278,287,309],"general":[15,39],"graph":[16,49,60,135],"is":[17,54,68,93,99,140,152,159,175,235,246,250,263,275,295],"NP-hard.":[18],"This":[19],"resolves":[20],"long-standing":[22,199],"open":[23,200],"problem":[24,41,173,201,293],"on":[25,202],"computational":[27],"complexity":[28,204],"outerthickness.":[30,207],"Moreover,":[31],"our":[32,195,218],"hardness":[33],"result":[34,129,196,219,223],"applies":[35,228],"to":[36,69,87,188,211,230],"more":[38],"covering":[40,123],"$P_F$,":[42],"defined":[43],"as":[44],"follows.":[45],"Fix":[46],"proper":[48,134],"class":[50,101,136,190,213,252,265,277],"$F$":[51,92,98,137,151,158,165,186,209,249,262,274],"whose":[52,138],"membership":[53,139],"decidable.":[55],"Given":[56],"an":[57,63,113],"undirected":[58],"simple":[59],"$G$":[61],"integer":[64,180,303],"$k$,":[65],"task":[67],"cover":[70,108],"edge":[72,114],"set":[73],"$E(G)$":[74],"by":[75,116],"at":[76],"most":[77],"$k$":[78],"subsets":[79],"$E_1,\\ldots,E_k$":[80],"such":[81,107],"each":[83,240,286],"subgraph":[84],"$(V(G),E_i)$":[85],"belongs":[86],"$F$.":[88],"Note":[89],"if":[91],"monotone":[94],"(in":[95],"particular,":[96],"when":[97],"all":[103,145,192,215,254,267,279],"outerplanar":[104,193],"graphs),":[105],"any":[106],"can":[109,313],"be":[110,314],"converted":[111],"into":[112],"partition":[115],"deleting":[117],"overlaps;":[118],"hence,":[119],"in":[120,297],"this":[121],"case,":[122],"partitioning":[125],"are":[126],"equivalent.":[127],"Our":[128],"shows":[130],"for":[132,177,224,300],"every":[133,178,301],"decidable":[141],"satisfies":[144],"following":[148],"conditions:":[149],"(a)":[150,259],"closed":[153,160],"under":[154,161],"topological":[155],"minors,":[156],"(b)":[157,271],"$1$-sums,":[162],"(c)":[164,283],"contains":[166],"cycle":[168],"length":[170],"$3$,":[171],"$P_F$":[174,294],"NP-hard":[176],"fixed":[179,302],"$k\\ge":[181,304],"3$.":[182],"In":[183],"particular:":[184],"For":[185,208,285],"equal":[187,210],"graphs,":[194,217,256],"settles":[197],"planar":[216],"complements":[220],"Mansfield's":[221],"NP-hardness":[222],"thickness,":[226],"which":[227],"only":[229],"case":[232],"$k=2$.":[233],"It":[234],"also":[236],"worth":[237],"noting":[238],"three":[243,289,311],"conditions":[244,312],"above":[245],"necessary.":[247],"If":[248,261,273],"eulerian":[255],"then":[257,269,281],"cond.":[258,270,282],"fails.":[260,272,284],"pseudoforests,":[268],"forests,":[280],"these":[288],"classes":[290],"$F$,":[291],"solvable":[296],"polynomial":[298],"time":[299],"3$,":[305],"showing":[306],"none":[308],"dropped.":[315]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-02-11T00:00:00"}