The following pages link to (Q4660723):
Displaying 13 items.
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- The complexity of generalized domino tilings (Q396923) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
