scientific article; zbMATH DE number 7559391
From MaRDI portal
Publication:5089181
DOI10.4230/LIPICS.MFCS.2020.20MaRDI QIDQ5089181FDOQ5089181
Tomás Feder, Richard C. Brewster, Nikola Jedličková, Jan Bok, Pavol Hell
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.05547
Title of this publication is not available (Why is that?)
Cites Work
- Signed graphs
- Signed graph coloring
- A mathematical bibliography of signed and gain graphs and allied areas
- On the notion of balance of a signed graph
- Title not available (Why is that?)
- On the complexity of H-coloring
- On the algebraic structure of combinatorial problems
- Monotone monadic SNP and constraint satisfaction
- List homomorphisms to reflexive graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Characterizations of signed graphs
- The Complexity of Colouring by Semicomplete Digraphs
- Title not available (Why is that?)
- A simple algorithm to detect balance in signed graphs
- The complexity of signed graph and edge-coloured graph homomorphisms
- Edge-switching homomorphisms of edge-coloured graphs
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring
- Homomorphisms of Signed Graphs
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
- Homomorphisms of signed graphs: an update
Cited In (6)
- List homomorphism problems for signed trees
- List homomorphisms to separable signed graphs
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
- List homomorphisms of graphs with bounded degrees
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
- List homomorphism: beyond the known boundaries
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)
