The following pages link to On the complexity of H-coloring (Q1100215):
Displaying 50 items.
- Colorings at minimum cost (Q960968) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Hom complexes and homotopy theory in the category of graphs (Q1003603) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Edge-switching homomorphisms of edge-coloured graphs (Q1045035) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- The complexity of multicolouring (Q1113919) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- Polynomial graph-colorings (Q1183345) (← links)
- A note on restricted \(H\)-colouring (Q1183461) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Homomorphisms to oriented cycles (Q1316647) (← links)
- The complexity of colouring symmetric relational systems (Q1327221) (← links)
- The complexity of infinite \(H\)-colouring (Q1333335) (← links)
- Good and semi-strong colorings of oriented planar graphs (Q1334637) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- Multiplicativity of acyclic digraphs (Q1377696) (← links)
- Covering regular graphs (Q1386472) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) (Q1417575) (← links)
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs (Q1421519) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- The complexity of \(H\)-colouring of bounded degree graphs (Q1579552) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- Oriented incidence colourings of digraphs (Q1630937) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Homomorphic preimages of geometric paths (Q1708401) (← links)
- The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
