Pages that link to "Item:Q4798127"

The following pages link to Bi‐arc graphs and the complexity of list homomorphisms (Q4798127):

Displaying 50 items.

• Testing list \(H\)-homomorphisms (Q347111) (← links)
• List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
• Clique versus independent set (Q402465) (← 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)
• The complexity of the list homomorphism problem for graphs (Q693060) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
• List matrix partitions of chordal graphs (Q817772) (← links)
• Digraph matrix partitions and trigraph homomorphisms (Q860407) (← 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)
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
• Extension problems with degree bounds (Q1028134) (← links)
• List homomorphisms to reflexive graphs (Q1127870) (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
• The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
• The restrictive \(H\)-coloring problem (Q1764813) (← links)
• Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
• List homomorphisms and circular arc graphs (Q1977431) (← links)
• Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
• The complexity of tropical graph homomorphisms (Q2012054) (← links)
• List homomorphism problems for signed trees (Q2111917) (← links)
• Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
• Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
• Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
• The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
• Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
• Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
• Majority constraints have bounded pathwidth duality (Q2427535) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• Representation characterizations of chordal bipartite graphs (Q2498738) (← links)
• Building blocks for the variety of absolute retracts (Q2502901) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← 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)
• Surjective \texttt{H}-colouring over reflexive digraphs (Q3304148) (← links)
• Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
• (Q4660723) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
• Consistency for counting quantifiers (Q5005107) (← links)
• (Q5089181) (← links)