{"id":"https://openalex.org/W2063984294","doi":"https://doi.org/10.1002/jgt.3190070406","title":"Hamiltonian path graphs","display_name":"Hamiltonian path graphs","publication_year":1983,"publication_date":"1983-12-01","ids":{"openalex":"https://openalex.org/W2063984294","doi":"https://doi.org/10.1002/jgt.3190070406","mag":"2063984294"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190070406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190070406","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5076706719","display_name":"Gary Chartrand","orcid":null},"institutions":[{"id":"https://openalex.org/I141649380","display_name":"Western Michigan University","ror":"https://ror.org/04j198w64","country_code":"US","type":"education","lineage":["https://openalex.org/I141649380"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gary Chartrand","raw_affiliation_strings":["Western Michigan University","Western MIchigan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Western Michigan University","institution_ids":["https://openalex.org/I141649380"]},{"raw_affiliation_string":"Western MIchigan University","institution_ids":["https://openalex.org/I141649380"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062694837","display_name":"Sanjiv Kapoor","orcid":"https://orcid.org/0000-0001-5637-9919"},"institutions":[{"id":"https://openalex.org/I141649380","display_name":"Western Michigan University","ror":"https://ror.org/04j198w64","country_code":"US","type":"education","lineage":["https://openalex.org/I141649380"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. F. Kapoor","raw_affiliation_strings":["Western Michigan University","Western MIchigan University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Western Michigan University","institution_ids":["https://openalex.org/I141649380"]},{"raw_affiliation_string":"Western MIchigan University","institution_ids":["https://openalex.org/I141649380"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069185876","display_name":"E. A. Nordhaus","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. A. Nordhaus","raw_affiliation_strings":["Michigan State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.2278429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"4","first_page":"419","last_page":"427"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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.9976000189781189,"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.9972000122070312,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9943000078201294,"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/combinatorics","display_name":"Combinatorics","score":0.7503548860549927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7373785376548767},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7088024616241455},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7016066908836365},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5287206768989563},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49654680490493774},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.45307657122612},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4426971971988678},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43656808137893677},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4356745481491089},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3689824044704437},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.32082465291023254},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3082984685897827},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.268255352973938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.04132303595542908}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7503548860549927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7373785376548767},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7088024616241455},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7016066908836365},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5287206768989563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49654680490493774},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.45307657122612},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4426971971988678},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43656808137893677},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4356745481491089},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3689824044704437},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.32082465291023254},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3082984685897827},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.268255352973938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.04132303595542908}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190070406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190070406","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":2,"referenced_works":["https://openalex.org/W2017108431","https://openalex.org/W2037791997"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W2952856011","https://openalex.org/W2019758609","https://openalex.org/W3010627705","https://openalex.org/W2969955840","https://openalex.org/W2046852387","https://openalex.org/W2928534012","https://openalex.org/W203133463","https://openalex.org/W1428816444","https://openalex.org/W4288375650"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Hamiltonian":[2,37,43,48],"path":[3,49],"graph":[4,8,12],"H(G)":[5],"of":[6,42],"a":[7,36],"G":[9,19,34],"is":[10,51],"that":[11],"having":[13],"the":[14],"same":[15],"vertex":[16],"set":[17],"as":[18],"and":[20,26,31],"in":[21],"which":[22],"two":[23],"vertices":[24],"u":[25],"v":[27],"are":[28],"adjacent":[29],"if":[30,33],"only":[32],"contains":[35],"u\u2010v":[38],"path.":[39],"A":[40],"characterization":[41],"graphs":[44,50],"isomorphic":[45],"to":[46],"their":[47],"presented.":[52]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}