{"id":"https://openalex.org/keywords/three-coloring","display_name":"three-coloring","description":"Three-coloring is the assignment of at most three colors to graph vertices or map regions so that adjacent elements receive different colors.","display_name_alternatives":[],"ids":{"openalex":"https://openalex.org/keywords/three-coloring","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.3824,"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.3824,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.2002,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":127,"cited_by_count":1535,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/three-coloring","updated_date":"2026-11-16T04:05:30","created_date":"2026-09-30T00:00:00"}
