{"id":"https://openalex.org/keywords/partial-k-trees","display_name":"partial k-trees","description":"A class of graphs that are subgraphs of k-trees, studied in graph theory and used in algorithms for problems on structured graphs.","display_name_alternatives":["partial k-tree","graphs of treewidth at most k"],"ids":{"openalex":"https://openalex.org/keywords/partial-k-trees","wikidata":"https://www.wikidata.org/wiki/Q7140374"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6727,"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.6727,"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.1673,"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":217,"cited_by_count":7015,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/partial-k-trees","updated_date":"2026-11-21T04:06:33","created_date":"2026-09-30T00:00:00"}
