{"id":"https://openalex.org/keywords/tree-depth","display_name":"tree depth","description":"Tree-depth is a graph invariant measuring how deeply a graph can be represented by a rooted forest under specified adjacency constraints.","display_name_alternatives":["treedepth","vertex ranking number","centered chromatic number","ordered chromatic number","td(G)"],"ids":{"openalex":"https://openalex.org/keywords/tree-depth","wikidata":"https://www.wikidata.org/wiki/Q7837500"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.419,"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.419,"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":950,"cited_by_count":12455,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/tree-depth","updated_date":"2026-11-20T04:06:44","created_date":"2022-04-12T19:38:12"}
