Min orderings and list homomorphism dichotomies for graphs and signed graphs
From MaRDI portal
Publication:6582375
DOI10.1007/s00453-024-01228-1MaRDI QIDQ6582375
Nikola Jedličková, Pavol Hell, Jan Bok, Richard C. Brewster, Arash Rafiey
Publication date: 2 August 2024
Published in: Algorithmica (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Permutation bigraphs and interval containments
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- On orthogonal ray graphs
- On the complexity of H-coloring
- Signed graph coloring
- 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
- List homomorphism problems for signed trees
- Homomorphisms of signed graphs: an update
- The complexity of signed graph and edge-coloured graph homomorphisms
- Representation characterizations of chordal bipartite graphs
- Approximation of Minimum Cost Homomorphisms
- Bi‐arc graphs and the complexity of list homomorphisms
- Monotone monadic SNP and constraint satisfaction
- Nowhere-zero flows in signed graphs: A survey
- List homomorphisms to separable signed graphs
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
This page was built for publication: Min orderings and list homomorphism dichotomies for graphs and signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582375)
