{"id":"https://openalex.org/keywords/planarity-testing","display_name":"planarity testing","description":"The graph-algorithmic problem of determining whether a graph can be drawn in a plane without edges crossing.","display_name_alternatives":["planarity test","planarity problem","graph planarity testing","testing graph planarity","planarity checking"],"ids":{"openalex":"https://openalex.org/keywords/planarity-testing","wikidata":"https://www.wikidata.org/wiki/Q7200967"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4538,"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.4538,"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.3239,"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":341,"cited_by_count":6992,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/planarity-testing","updated_date":"2026-11-18T04:07:20","created_date":"2022-04-12T19:38:12"}
