scientific article; zbMATH DE number 7796796

DOI10.5666/kmj.2023.63.3.355zbMath1529.05069MaRDI QIDQ6185533

Mark H. Siggers, Hyobeen Kim

Publication date: 29 January 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

signed graphswitchinglist colouringedge coloured graphhomomorphism complexity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• On the complexity of H-coloring
• List homomorphisms to reflexive graphs
• Signed graphs
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring
• List homomorphism problems for signed trees
• The complexity of signed graph and edge-coloured graph homomorphisms
• On the notion of balance of a signed graph
• Complexity of conservative constraint satisfaction problems
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Bi‐arc graphs and the complexity of list homomorphisms
• A Proof of the CSP Dichotomy Conjecture
• Homomorphisms of Signed Graphs
• The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
• Min orderings and list homomorphism dichotomies for signed and unsigned graphs

This page was built for publication: