{"id":"https://openalex.org/keywords/k-trees","display_name":"k-trees","description":"K-trees are graphs constructed from a complete graph on k vertices by repeatedly adding vertices adjacent to an existing k-clique.","display_name_alternatives":["k-tree"],"ids":{"openalex":"https://openalex.org/keywords/k-trees","wikidata":"https://www.wikidata.org/wiki/Q12027616"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4465,"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.4465,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0821,"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"}}],"works_count":417,"cited_by_count":9542,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/k-trees","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
