scientific article; zbMATH DE number 7559391
From MaRDI portal
Publication:5089181
DOI10.4230/LIPIcs.MFCS.2020.20MaRDI QIDQ5089181
Richard C. Brewster, Nikola Jedličková, Jan Bok, Tomás Feder, Pavol Hell
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.05547
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity ⋮ List homomorphisms to separable signed graphs ⋮ Min orderings and list homomorphism dichotomies for signed and unsigned graphs ⋮ List homomorphism: beyond the known boundaries ⋮ List homomorphism problems for signed trees
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-switching homomorphisms of edge-coloured graphs
- On the complexity of H-coloring
- List homomorphisms to reflexive graphs
- Signed graphs
- Signed graph coloring
- A simple algorithm to detect balance in signed graphs
- On the algebraic structure of combinatorial problems
- A mathematical bibliography of signed and gain graphs and allied areas
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Homomorphisms of signed graphs: an update
- The complexity of signed graph and edge-coloured graph homomorphisms
- On the notion of balance of a signed graph
- The Complexity of Colouring by Semicomplete Digraphs
- Characterizations of signed graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Monotone monadic SNP and constraint satisfaction
- Homomorphisms of Signed Graphs
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
This page was built for publication:
