scientific article; zbMATH DE number 7559391
From MaRDI portal
Publication:5089181
Cites work
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- A mathematical bibliography of signed and gain graphs and allied areas
- A simple algorithm to detect balance in signed graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Characterizations of signed graphs
- Edge-switching homomorphisms of edge-coloured graphs
- Homomorphisms of signed graphs
- Homomorphisms of signed graphs: an update
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 1409183 (Why is no real title available?)
- List homomorphisms to reflexive graphs
- Monotone monadic SNP and constraint satisfaction
- On the algebraic structure of combinatorial problems
- On the complexity of H-coloring
- On the notion of balance of a signed graph
- Signed graph coloring
- Signed graphs
- The Complexity of Colouring by Semicomplete Digraphs
- The complexity of homomorphisms of signed graphs and signed constraint satisfaction
- The complexity of signed graph and edge-coloured graph homomorphisms
Cited in
(8)- List homomorphism problems for signed trees
- 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
- List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
- List homomorphisms of graphs with bounded degrees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089181)
