Pages that link to "Item:Q2184689"
From MaRDI portal
The following pages link to Complexity of correspondence \(H\)-colourings (Q2184689):
Displaying 7 items.
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- The complexity of colouring symmetric relational systems (Q1327221) (← links)
- The complexity of infinite \(H\)-colouring (Q1333335) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group (Q2715944) (← links)
- Structure Learning of $H$-colorings (Q4617600) (← links)
- (Q4660723) (← links)