Towards a dichotomy for the list switch homomorphism problem for signed graphs
From MaRDI portal
Publication:6185533
DOI10.5666/KMJ.2023.63.3.355zbMATH Open1529.05069MaRDI QIDQ6185533FDOQ6185533
Authors: Hyobeen Kim, Mark Siggers 
Publication date: 29 January 2024
Recommendations
- The complexity of signed graph and edge-coloured graph homomorphisms
- List homomorphism problems for signed trees
- The complexity of homomorphisms of signed graphs and signed constraint satisfaction
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- Complexity of planar signed graph homomorphisms to cycles
Cites Work
- Signed graphs
- On the notion of balance of a signed graph
- On the complexity of H-coloring
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Complexity of conservative constraint satisfaction problems
- List homomorphisms to reflexive graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Interval-like graphs and digraphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Homomorphisms of signed graphs
- The complexity of homomorphisms of signed graphs and signed constraint satisfaction
- A proof of the CSP dichotomy conjecture
- List homomorphism problems for signed trees
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
Cited In (1)
This page was built for publication: Towards a dichotomy for the list switch homomorphism problem for signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185533)
