{"id":"https://openalex.org/keywords/four-color-problem","display_name":"four-color problem","description":"A mathematical graph-coloring problem asking whether every planar map can be colored with at most four colors so adjacent regions differ.","display_name_alternatives":["four-colour problem","four-color conjecture","four-colour conjecture","4-color problem"],"ids":{"openalex":"https://openalex.org/keywords/four-color-problem","wikidata":"https://www.wikidata.org/wiki/Q184410"},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4511,"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.4511,"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/T12170","display_name":"History and Theory of Mathematics","score":0.0887,"subfield":{"id":"https://openalex.org/subfields/1207","display_name":"History and Philosophy of Science"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"works_count":218,"cited_by_count":1393,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/four-color-problem","updated_date":"2026-11-22T04:06:09","created_date":"2026-09-30T00:00:00"}
