{"id":"https://openalex.org/W1062512397","doi":"https://doi.org/10.1137/140971610","title":"Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lov\u00e1sz--Plummer Conjecture on Halin Graphs","display_name":"Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lov\u00e1sz--Plummer Conjecture on Halin Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1062512397","doi":"https://doi.org/10.1137/140971610","mag":"1062512397"},"language":"en","primary_location":{"id":"doi:10.1137/140971610","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140971610","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042737832","display_name":"Guantao Chen","orcid":"https://orcid.org/0000-0002-3118-6632"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guantao Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111403910","display_name":"Hikoe Enomoto","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hikoe Enomoto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080040800","display_name":"Kenta Ozeki","orcid":"https://orcid.org/0000-0003-3118-0086"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenta Ozeki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061553466","display_name":"Shoichi Tsuchiya","orcid":"https://orcid.org/0000-0001-9006-5120"},"institutions":[{"id":"https://openalex.org/I85283370","display_name":"Senshu University","ror":"https://ror.org/03jzxkg37","country_code":"JP","type":"education","lineage":["https://openalex.org/I85283370"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shoichi Tsuchiya","raw_affiliation_strings":["Senshu Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Senshu Univ","institution_ids":["https://openalex.org/I85283370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4117,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.8154686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"3","first_page":"1423","last_page":"1426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9983999729156494,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8805413246154785},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8747258186340332},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5326670408248901},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5244341492652893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5225512385368347},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.4576491415500641},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4404025077819824},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4100974500179291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3587496280670166},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22932904958724976},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1879873275756836}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8805413246154785},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8747258186340332},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5326670408248901},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5244341492652893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5225512385368347},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.4576491415500641},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4404025077819824},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4100974500179291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3587496280670166},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22932904958724976},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1879873275756836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140971610","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140971610","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G798092618","display_name":"The Hamiltonicity of 4-connected graphs on the torus","funder_award_id":"25871053","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1969029923","https://openalex.org/W2059111427","https://openalex.org/W2073048127","https://openalex.org/W2129166227"],"related_works":["https://openalex.org/W2382032469","https://openalex.org/W1966931974","https://openalex.org/W4301179398","https://openalex.org/W4389914601","https://openalex.org/W4231397933","https://openalex.org/W2406749215","https://openalex.org/W2487945693","https://openalex.org/W4292517404","https://openalex.org/W2159421784","https://openalex.org/W2594655405"],"abstract_inverted_index":{"A":[0],"\\sl":[1],"Halin":[2,41],"graph":[3,8],"is":[4],"a":[5,11,18,39],"simple":[6],"plane":[7,36],"consisting":[9],"of":[10,24,51],"tree":[12],"without":[13],"degree":[14],"2":[15],"vertices":[16],"and":[17,30],"cycle":[19],"induced":[20],"by":[21],"the":[22,25,54],"leaves":[23],"tree.":[26],"In":[27,43],"1975,":[28],"Lov\u00e1sz":[29],"Plummer":[31],"conjectured":[32],"that":[33],"every":[34],"4-connected":[35],"triangulation":[37],"has":[38],"spanning":[40],"subgraph.":[42],"this":[44],"paper,":[45],"we":[46],"construct":[47],"an":[48],"infinite":[49],"family":[50],"counterexamples":[52],"to":[53],"conjecture.":[55]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}