{"id":"https://openalex.org/W1979365249","doi":"https://doi.org/10.1002/jgt.3190110312","title":"On the hamiltonian path graph of a graph","display_name":"On the hamiltonian path graph of a graph","publication_year":1987,"publication_date":"1987-09-01","ids":{"openalex":"https://openalex.org/W1979365249","doi":"https://doi.org/10.1002/jgt.3190110312","mag":"1979365249"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190110312","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190110312","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/A5056897157","display_name":"George R. T. Hendry","orcid":null},"institutions":[{"id":"https://openalex.org/I195460627","display_name":"University of Aberdeen","ror":"https://ror.org/016476m91","country_code":"GB","type":"education","lineage":["https://openalex.org/I195460627"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"George R. T. Hendry","raw_affiliation_strings":["Aberdeen University, Scotland"],"affiliations":[{"raw_affiliation_string":"Aberdeen University, Scotland","institution_ids":["https://openalex.org/I195460627"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056897157"],"corresponding_institution_ids":["https://openalex.org/I195460627"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":2.2689,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83333333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"3","first_page":"373","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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/T11476","display_name":"Graph theory and applications","score":0.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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.8273262977600098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7561147809028625},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6471449136734009},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5291241407394409},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48560160398483276},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.47463783621788025},{"id":"https://openalex.org/keywords/quartic-graph","display_name":"Quartic graph","score":0.4695575535297394},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44260239601135254},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.42476123571395874},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4137343764305115},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.29836177825927734}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8273262977600098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7561147809028625},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6471449136734009},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5291241407394409},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48560160398483276},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.47463783621788025},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.4695575535297394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44260239601135254},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.42476123571395874},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4137343764305115},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.29836177825927734}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190110312","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190110312","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1993348640","https://openalex.org/W1996106086","https://openalex.org/W2039190727","https://openalex.org/W2063984294"],"related_works":["https://openalex.org/W2377278407","https://openalex.org/W4293154719","https://openalex.org/W1534832295","https://openalex.org/W2057580655","https://openalex.org/W3119766805","https://openalex.org/W1969871488","https://openalex.org/W1978219832","https://openalex.org/W2319833372","https://openalex.org/W2070086094","https://openalex.org/W2963201929"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"hamiltonian":[2,37,61,72,100],"path":[3,62,101],"graph":[4,8,12,73,104],"H(F)":[5,83,122],"of":[6,48,55,70,75,95,98,127],"a":[7,36,46,53,71,99,103,124],"F":[9,19,34,74,105],"is":[10,64,84,88,111],"that":[11,79,90],"having":[13],"the":[14,67,92,96],"same":[15],"vertex":[16],"set":[17],"as":[18],"and":[20,26,31,51],"in":[21,43,102],"which":[22],"two":[23],"vertices":[24,110],"u":[25,38],"v":[27,40],"are":[28],"adjacent":[29],"if":[30,33,91],"only":[32],"contains":[35,123],"\u2212":[39],"path.":[41],"First,":[42],"response":[44],"to":[45,59],"conjecture":[47],"Chartrand,":[49],"Kapoor":[50],"Nordhaus,":[52],"characterization":[54],"nonhamiltonian":[56],"graphs":[57,63],"isomorphic":[58],"their":[60],"presented.":[65],"Next,":[66],"maximum":[68],"size":[69],"given":[76],"order":[77,128],"such":[78],"K\u0304":[80],"d":[81],"\u2286":[82],"determined.":[85],"Finally,":[86],"it":[87],"shown":[89],"degree":[93],"sum":[94],"endvertices":[97],"with":[106],"at":[107,112],"least":[108,113],"five":[109],"|":[114,116],"V(F)":[115],"+":[117,130],"t(t":[118],"\u2a7e":[119],"0),":[120],"then":[121],"complete":[125],"subgraph":[126],"t":[129],"4.":[131]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}