{"id":"https://openalex.org/W2034179737","doi":"https://doi.org/10.1109/eurocon.2011.5929160","title":"A novel condition for Hamiltonicity; constructing Hamiltonian circuits","display_name":"A novel condition for Hamiltonicity; constructing Hamiltonian circuits","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2034179737","doi":"https://doi.org/10.1109/eurocon.2011.5929160","mag":"2034179737"},"language":"en","primary_location":{"id":"doi:10.1109/eurocon.2011.5929160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eurocon.2011.5929160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE EUROCON - International Conference on Computer as a Tool","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076094571","display_name":"Maria Cristina C. Onete","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. C. C. Onete","raw_affiliation_strings":["CASED, Technical University of Darmstadt, Darmstadt, Germany","CASED & TU Darmstadt, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CASED, Technical University of Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"CASED & TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053551907","display_name":"Cristian E. Onete","orcid":"https://orcid.org/0000-0001-6134-5908"},"institutions":[{"id":"https://openalex.org/I109147379","display_name":"NXP (Netherlands)","ror":"https://ror.org/059be4e97","country_code":"NL","type":"company","lineage":["https://openalex.org/I109147379"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"C. E. Onete","raw_affiliation_strings":["IP & L Department, NXP Semiconductors, Eindhoven, Netherlands","IP & L Department, NXP Semiconductors, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IP & L Department, NXP Semiconductors, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I109147379"]},{"raw_affiliation_string":"IP & L Department, NXP Semiconductors, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I109147379"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4756,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59301481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/spanning-tree","display_name":"Spanning tree","score":0.7310413122177124},{"id":"https://openalex.org/keywords/incidence-matrix","display_name":"Incidence matrix","score":0.6601961255073547},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.6115357875823975},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5876498818397522},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5580134987831116},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5506160855293274},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5075796842575073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46925875544548035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43230703473091125},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4229051470756531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37289249897003174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32692188024520874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17571285367012024},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09279227256774902}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7310413122177124},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.6601961255073547},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.6115357875823975},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5876498818397522},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5580134987831116},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5506160855293274},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5075796842575073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46925875544548035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43230703473091125},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4229051470756531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37289249897003174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32692188024520874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17571285367012024},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09279227256774902},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/eurocon.2011.5929160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eurocon.2011.5929160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE EUROCON - International Conference on Computer as a Tool","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W629758729","https://openalex.org/W1583968613","https://openalex.org/W1977463365","https://openalex.org/W2164776332"],"related_works":["https://openalex.org/W2040226988","https://openalex.org/W2137653284","https://openalex.org/W2093080906","https://openalex.org/W2076571891","https://openalex.org/W2367979467","https://openalex.org/W2056738160","https://openalex.org/W1977463365","https://openalex.org/W2160727383","https://openalex.org/W2370847396","https://openalex.org/W2050866845"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"derive":[4],"a":[5,12,18,25],"new":[6],"necessary":[7],"and":[8,29,45],"sufficient":[9],"condition":[10],"for":[11],"simple,":[13],"undirected":[14],"graph":[15],"to":[16],"have":[17],"Hamiltonian":[19,31],"circuit.":[20],"Our":[21],"novel":[22],"approach":[23],"uses":[24],"modified":[26],"incidence":[27],"matrix":[28],"constructs":[30],"circuits":[32],"from":[33],"the":[34,41],"graph's":[35],"spanning":[36],"trees.":[37],"We":[38],"furthermore":[39],"optimise":[40],"underlying":[42],"spanning-tree":[43],"algorithm,":[44],"give":[46],"an":[47],"example":[48],"of":[49],"our":[50],"results.":[51]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}