{"id":"https://openalex.org/keywords/h-coloring","display_name":"H-coloring","description":"A graph homomorphism problem that asks whether a graph can be mapped to a fixed target graph while preserving adjacency.","display_name_alternatives":["H-colouring","H-colorability","H-colourability","graph homomorphism to H"],"ids":{"openalex":"https://openalex.org/keywords/h-coloring","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8623,"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.8623,"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":120,"cited_by_count":2010,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/h-coloring","updated_date":"2026-11-20T04:06:44","created_date":"2026-09-30T00:00:00"}
