H-coloring
Description: A graph homomorphism problem that asks whether a graph can be mapped to a fixed target graph while preserving adjacency.
Primary topic: Advanced Graph Theory Research (86%)
Related topic: Advanced Graph Theory Research (86%)
OpenAlex ID: keywords/h-coloring
