Pages that link to "Item:Q444433"

The following pages link to The complexity of surjective homomorphism problems-a survey (Q444433):

Displaying 32 items.

• Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
• An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
• Tractability conditions for numeric CSPs (Q683751) (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
• Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
• Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
• On rainbow-free colourings of uniform hypergraphs (Q1981770) (← links)
• Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
• Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
• Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• (Q3304148) (← links)
• (Q5009627) (← links)
• (Q5075768) (← links)
• (Q5090503) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
• (Q5232905) (← links)
• Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
• Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
• Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
• Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
• Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
• A note on rainbow-free colorings of uniform hypergraphs (Q6180576) (← links)