Pages that link to "Item:Q1660261"
From MaRDI portal
The following pages link to A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261):
Displaying 9 items.
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- (Q5089181) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- (Q6185533) (← links)
