Pages that link to "Item:Q2374178"
From MaRDI portal
The following pages link to The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178):
Displaying 21 items.
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Homomorphisms of sparse signed graphs (Q782945) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← 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)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
- Analogues of cliques for \((m,n)\)-colored mixed graphs (Q2409513) (← links)
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs (Q2414452) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- (Q3300693) (← links)
- Coloring problem of signed interval graphs (Q4997206) (← links)
- (Q5089181) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 (Q6123389) (← links)
- (Q6185533) (← links)
