{"id":"https://openalex.org/W4312206763","doi":"https://doi.org/10.3233/fi-222139","title":"On Finding Hamiltonian Cycles in Barnette Graphs","display_name":"On Finding Hamiltonian Cycles in Barnette Graphs","publication_year":2022,"publication_date":"2022-12-27","ids":{"openalex":"https://openalex.org/W4312206763","doi":"https://doi.org/10.3233/fi-222139"},"language":"en","primary_location":{"id":"doi:10.3233/fi-222139","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-222139","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5045403257","display_name":"Behrooz Bagheri Gh.","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Behrooz Bagheri Gh.","raw_affiliation_strings":["Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria","Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria. behrooz@ac.tuwien.ac.at"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria. behrooz@ac.tuwien.ac.at","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109192583","display_name":"Tom\u00e1s Feder","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tomas Feder","raw_affiliation_strings":["Computer Science Department, Stanford University, Stanford, California 94305, USA","Computer Science Department, Stanford University, Stanford, California 94305, USA. tomas@theory.stanford.edu"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, California 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Computer Science Department, Stanford University, Stanford, California 94305, USA. tomas@theory.stanford.edu","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088309054","display_name":"Herbert Fleischner","orcid":"https://orcid.org/0000-0001-8588-5212"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Herbert Fleischner","raw_affiliation_strings":["Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria","Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria. fleischner@ac.tuwien.ac.at"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Algorithms and Complexity Group, Vienna University of Technology, Favoritenstrasse 9-11, 1040 Vienna, Austria. fleischner@ac.tuwien.ac.at","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004849184","display_name":"Carlos Subi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210151393","display_name":"Universidad San Carlos","ror":"https://ror.org/05b1ymr19","country_code":"PY","type":"education","lineage":["https://openalex.org/I4210151393"]}],"countries":["PY"],"is_corresponding":false,"raw_author_name":"Carlos Subi","raw_affiliation_strings":["]","carlos.subi@hotmail.com","]; carlos.subi@hotmail.com"],"affiliations":[{"raw_affiliation_string":"]","institution_ids":[]},{"raw_affiliation_string":"carlos.subi@hotmail.com","institution_ids":["https://openalex.org/I4210151393"]},{"raw_affiliation_string":"]; carlos.subi@hotmail.com","institution_ids":["https://openalex.org/I4210151393"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088309054"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.1461,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51180865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"188","issue":"1","first_page":"1","last_page":"14"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8052041530609131},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7987551689147949},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6269440054893494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6171233057975769},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5423560738563538},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5246908068656921},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4983367919921875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4936009645462036},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4158726930618286},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4145231544971466},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.318164587020874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2934108078479767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23391583561897278}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8052041530609131},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7987551689147949},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6269440054893494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6171233057975769},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5423560738563538},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5246908068656921},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4983367919921875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4936009645462036},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4158726930618286},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4145231544971466},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.318164587020874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2934108078479767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23391583561897278},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-222139","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-222139","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3123513344","https://openalex.org/W2040226988","https://openalex.org/W1933485572","https://openalex.org/W1541834747","https://openalex.org/W2045730620","https://openalex.org/W4299564171","https://openalex.org/W2761007407","https://openalex.org/W4299367522","https://openalex.org/W2395770054","https://openalex.org/W603403972"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,39],"deal":[4],"with":[5],"hamiltonicity":[6,48],"in":[7,23,49],"planar":[8,51],"cubic":[9,52],"graphs":[10,54],"G":[11],"having":[12],"a":[13],"facial":[14],"2\u2013factor":[15],"\ud835\udcac":[16],"via":[17],"(quasi)":[18,33],"spanning":[19,34],"trees":[20,35],"of":[21,30,36],"faces":[22],"G/\ud835\udcac":[24],"and":[25],"study":[26],"the":[27],"algorithmic":[28],"complexity":[29],"finding":[31],"such":[32],"faces.":[37],"Moreover,":[38],"show":[40],"that":[41],"if":[42],"Barnette\u2019s":[43],"Conjecture":[44],"is":[45,55],"false,":[46],"then":[47],"3\u2013connected":[50],"bipartite":[53],"an":[56],"NP-complete":[57],"problem.":[58]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}