{"id":"https://openalex.org/W4212928753","doi":"https://doi.org/10.1142/s1793830922500604","title":"A note on Hamiltonian cycles in planar graphs","display_name":"A note on Hamiltonian cycles in planar graphs","publication_year":2022,"publication_date":"2022-02-17","ids":{"openalex":"https://openalex.org/W4212928753","doi":"https://doi.org/10.1142/s1793830922500604"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922500604","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500604","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5071469388","display_name":"Martin Kreh","orcid":"https://orcid.org/0000-0002-4302-6732"},"institutions":[{"id":"https://openalex.org/I155765044","display_name":"University of Hildesheim","ror":"https://ror.org/02f9det96","country_code":"DE","type":"education","lineage":["https://openalex.org/I155765044"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Kreh","raw_affiliation_strings":["Institute of Mathematics and Applied Computer Science, University of Hildesheim, Samelsonplatz 1, 31141 Hildesheim, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4302-6732","affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Applied Computer Science, University of Hildesheim, Samelsonplatz 1, 31141 Hildesheim, Germany","institution_ids":["https://openalex.org/I155765044"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071469388"],"corresponding_institution_ids":["https://openalex.org/I155765044"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03250554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"01","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.9998999834060669,"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.9998999834060669,"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.9994000196456909,"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.9976999759674072,"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/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7403115034103394},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.729257345199585},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6793858408927917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6213513016700745},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6100993752479553},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5952393412590027},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.5794808268547058},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.5266033411026001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5097152590751648},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.44231560826301575},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42023012042045593},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4119148254394531},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.25835466384887695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21222227811813354},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2007204294204712},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12419238686561584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11468058824539185},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.09814321994781494},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.0961187481880188}],"concepts":[{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7403115034103394},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.729257345199585},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6793858408927917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6213513016700745},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6100993752479553},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5952393412590027},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.5794808268547058},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.5266033411026001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5097152590751648},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.44231560826301575},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42023012042045593},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4119148254394531},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.25835466384887695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21222227811813354},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2007204294204712},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12419238686561584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11468058824539185},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.09814321994781494},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0961187481880188},{"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.1142/s1793830922500604","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500604","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1975951388","https://openalex.org/W1983755786","https://openalex.org/W1997168007","https://openalex.org/W2030087828","https://openalex.org/W2038386445","https://openalex.org/W2050065904","https://openalex.org/W2117504940","https://openalex.org/W2132248880"],"related_works":["https://openalex.org/W2371794074","https://openalex.org/W4206195007","https://openalex.org/W1983755786","https://openalex.org/W2985721051","https://openalex.org/W2101009118","https://openalex.org/W2379287707","https://openalex.org/W2800672050","https://openalex.org/W2032869579","https://openalex.org/W4212928753","https://openalex.org/W1975729263"],"abstract_inverted_index":{"Unlike":[0],"the":[1,7],"problem":[2,8],"of":[3,9,40],"finding":[4],"Eulerian":[5],"cycles,":[6],"deciding":[10],"whether":[11],"a":[12,16,66,71],"given":[13],"graph":[14,67],"has":[15],"Hamiltonian":[17,72],"cycle":[18],"is":[19],"NP-complete,":[20],"even":[21],"when":[22],"restricting":[23],"to":[24,63],"planar":[25],"graphs.":[26],"There":[27],"are":[28],"however":[29],"some":[30,53],"criteria":[31,58],"that":[32,65],"can":[33,42],"be":[34,43],"used":[35],"in":[36],"special":[37],"cases.":[38],"One":[39],"them":[41],"derived":[44,59],"by":[45],"Grinberg\u2019s":[46,61],"theorem.":[47],"In":[48],"this":[49],"note,":[50],"we":[51],"give":[52],"more":[54,56],"(slightly":[55],"general)":[57],"from":[60],"theorem":[62],"show":[64],"does":[68],"not":[69],"have":[70],"cycle.":[73]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}