List homomorphisms to separable signed graphs

DOI10.1007/978-3-030-95018-7_3OpenAlexW4207071843MaRDI QIDQ6102261

Nikola Jedličková, Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Min orderings and list homomorphism dichotomies for signed and unsigned graphs ⋮ List homomorphism: beyond the known boundaries

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
• List homomorphisms and circular arc graphs
• 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
• Characterizations of signed graphs
• Bi‐arc graphs and the complexity of list homomorphisms
• Monotone monadic SNP and constraint satisfaction
• Homomorphisms of Signed Graphs

This page was built for publication: List homomorphisms to separable signed graphs