{"id":"https://openalex.org/keywords/hamilton-connectedness","display_name":"Hamilton-connectedness","description":"A graph-theoretic property in which every pair of distinct vertices is joined by a Hamiltonian path.","display_name_alternatives":["Hamilton connectivity"],"ids":{"openalex":"https://openalex.org/keywords/hamilton-connectedness","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6965,"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.6965,"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.0929,"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"}}],"works_count":120,"cited_by_count":1355,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/hamilton-connectedness","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
