{"id":"https://openalex.org/keywords/linear-arboricity","display_name":"linear arboricity","description":"Linear arboricity is a graph invariant measuring the minimum number of linear forests into which a graph\u2019s edges can be partitioned.","display_name_alternatives":["la(G)","linear arboricity of a graph"],"ids":{"openalex":"https://openalex.org/keywords/linear-arboricity","wikidata":"https://www.wikidata.org/wiki/Q25303647"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8394,"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.8394,"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":127,"cited_by_count":1186,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/linear-arboricity","updated_date":"2026-11-13T04:07:14","created_date":"2026-09-30T00:00:00"}
