Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs

DOI10.1007/978-3-540-85097-7_35zbMath1168.05312OpenAlexW1576493106MaRDI QIDQ5505675

No author found.

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_35

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Colouring, constraint satisfaction, and complexity ⋮ Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum cost homomorphisms to semicomplete multipartite digraphs
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
• On the complexity of H-coloring
• In-tournament digraphs
• A dichotomy for minimum cost graph homomorphisms
• Level of repair analysis and minimum cost homomorphisms of graphs
• Minimum cost and list homomorphisms to semicomplete digraphs
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles
• Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
• Generalizations of tournaments: A survey
• Digraphs with the path‐merging property
• Minimum Cost Homomorphisms to Reflexive Digraphs
• Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs

This page was built for publication: Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs