The following pages link to On the complexity of H-coloring (Q1100215):
Displaying 50 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- A dichotomy for real weighted Holant problems (Q260401) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The complexity of counting quantifiers on equality languages (Q515549) (← links)
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- On the homomorphism order of labeled posets (Q634750) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- The core of a graph (Q686290) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Finite dualities and map-critical graphs on a fixed surface (Q765196) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- On a new reformulation of Hadwiger's conjecture (Q856862) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- Colorings at minimum cost (Q960968) (← links)
