{"id":"https://openalex.org/W2481278500","doi":"https://doi.org/10.1142/s1793830922501130","title":"2-Trees: Structural insights and the study of Hamiltonian paths","display_name":"2-Trees: Structural insights and the study of Hamiltonian paths","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W2481278500","doi":"https://doi.org/10.1142/s1793830922501130","mag":"2481278500"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922501130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501130","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/A5005298039","display_name":"P. Renjith","orcid":null},"institutions":[{"id":"https://openalex.org/I26072440","display_name":"Indian Institute of Information Technology Allahabad","ror":"https://ror.org/03rgjt374","country_code":"IN","type":"education","lineage":["https://openalex.org/I26072440"]},{"id":"https://openalex.org/I4387155923","display_name":"Indian Institute of Information Technology Design and Manufacturing, Kurnool","ror":"https://ror.org/01kw6bd80","country_code":null,"type":"education","lineage":["https://openalex.org/I4387155923"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"P. Renjith","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Information Technology, Design and Manufacturing Kurnool, Andhra Pradesh, India"],"raw_orcid":"https://orcid.org/0000-0002-4934-4571","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Information Technology, Design and Manufacturing Kurnool, Andhra Pradesh, India","institution_ids":["https://openalex.org/I26072440","https://openalex.org/I4387155923"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075479783","display_name":"N. Sadagopan","orcid":null},"institutions":[{"id":"https://openalex.org/I39244652","display_name":"Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram","ror":"https://ror.org/023c9pb11","country_code":"IN","type":"education","lineage":["https://openalex.org/I39244652"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N. Sadagopan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Information Technology, Design and Manufacturing Kancheepuram, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Information Technology, Design and Manufacturing Kancheepuram, Chennai, India","institution_ids":["https://openalex.org/I39244652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005298039"],"corresponding_institution_ids":["https://openalex.org/I26072440","https://openalex.org/I4387155923"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00167254,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"04","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/T11797","display_name":"graph theory and CDMA systems","score":0.9962000250816345,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.7881860733032227},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7483786940574646},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6799466609954834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6507652997970581},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6023467183113098},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.48972299695014954},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4330659806728363},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41872382164001465},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4129215180873871},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40313607454299927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24144047498703003},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1786629557609558},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16780009865760803},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1223154366016388},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11465013027191162}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7881860733032227},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7483786940574646},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6799466609954834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6507652997970581},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6023467183113098},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.48972299695014954},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4330659806728363},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41872382164001465},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4129215180873871},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40313607454299927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24144047498703003},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1786629557609558},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16780009865760803},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1223154366016388},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11465013027191162},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830922501130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922501130","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":[{"id":"https://openalex.org/G4618719349","display_name":null,"funder_award_id":"ECR/2017/001442","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W77981510","https://openalex.org/W413067204","https://openalex.org/W415832010","https://openalex.org/W1484040084","https://openalex.org/W1490862018","https://openalex.org/W1618127724","https://openalex.org/W1965948672","https://openalex.org/W1968832374","https://openalex.org/W1971367602","https://openalex.org/W1975099798","https://openalex.org/W1975951388","https://openalex.org/W1977636084","https://openalex.org/W1989983876","https://openalex.org/W1996311100","https://openalex.org/W1997940755","https://openalex.org/W2000467025","https://openalex.org/W2000934872","https://openalex.org/W2003376008","https://openalex.org/W2006711703","https://openalex.org/W2012772283","https://openalex.org/W2013853668","https://openalex.org/W2018876684","https://openalex.org/W2023478138","https://openalex.org/W2026190738","https://openalex.org/W2028363955","https://openalex.org/W2035089435","https://openalex.org/W2053623386","https://openalex.org/W2058707837","https://openalex.org/W2059260882","https://openalex.org/W2062333719","https://openalex.org/W2067313943","https://openalex.org/W2069093164","https://openalex.org/W2069397859","https://openalex.org/W2069905179","https://openalex.org/W2082268829","https://openalex.org/W2087818742","https://openalex.org/W2090118375","https://openalex.org/W2091151333","https://openalex.org/W2096036356","https://openalex.org/W2096399406","https://openalex.org/W2110444610","https://openalex.org/W2126442385","https://openalex.org/W2127206007","https://openalex.org/W2132624129","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W2324803598","https://openalex.org/W2401610261","https://openalex.org/W2746272674","https://openalex.org/W2796712670","https://openalex.org/W3149604617","https://openalex.org/W3149772931","https://openalex.org/W4230023436","https://openalex.org/W4237480940","https://openalex.org/W4245518162"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W4387272283","https://openalex.org/W2768859505","https://openalex.org/W2952856011","https://openalex.org/W2046852387","https://openalex.org/W2036803675","https://openalex.org/W2127206007","https://openalex.org/W2069133957","https://openalex.org/W2089894925","https://openalex.org/W2256329187"],"abstract_inverted_index":{"For":[0,15],"a":[1,4,12,37,47,66,82],"connected":[2],"graph,":[3],"path":[5,39],"containing":[6],"all":[7],"vertices":[8],"is":[9,19,43,79],"known":[10,21],"as":[11],"Hamiltonian":[13,30,38,56,73],"path.":[14],"general":[16,41],"graphs,":[17],"there":[18],"no":[20],"necessary":[22,48],"and":[23,32,49,90],"sufficient":[24,50],"condition":[25,51],"for":[26,52,69],"the":[27,33,53,70,86,91],"existence":[28,54,71],"of":[29,35,55,72,85,88],"paths":[31,57,74],"complexity":[34],"finding":[36],"in":[40,58,75,98],"graphs":[42],"NP-Complete.":[44],"We":[45],"present":[46,65],"2-trees.":[59,76,104],"Using":[60],"our":[61],"characterization,":[62],"we":[63],"also":[64],"linear-time":[67],"algorithm":[68],"Our":[77],"characterization":[78],"based":[80],"on":[81],"deep":[83],"understanding":[84],"structure":[87],"2-trees":[89],"combinatorics":[92],"presented":[93],"here":[94],"may":[95],"be":[96],"used":[97],"other":[99],"combinatorial":[100],"problems":[101],"restricted":[102],"to":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}