Pages that link to "Item:Q1127870"
From MaRDI portal
The following pages link to List homomorphisms to reflexive graphs (Q1127870):
Displaying 50 items.
- Testing list \(H\)-homomorphisms (Q347111) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Computational complexity of compaction to irreflexive cycles (Q596309) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Greedy algorithms, \(H\)-colourings and a complexity-theoretic dichotomy. (Q1401202) (← links)
- Complexity of homomorphisms to direct products of graphs (Q1603497) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On disconnected cuts and separators (Q2275942) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- On the extension of vertex maps to graph homomorphisms (Q2501538) (← links)
- Building blocks for the variety of absolute retracts (Q2502901) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Adjusted Interval Digraphs (Q2839215) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q3304125) (← links)
- (Q3304148) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
