The following pages link to Homomorphisms of Signed Graphs (Q5265329):
Displaying 50 items.
- 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)
- On the achromatic number of signed graphs (Q1711838) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- Frustration-critical signed graphs (Q2081482) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Complex and homomorphic chromatic number of signed planar simple graphs (Q2117521) (← links)
- Characterizations of line graphs in signed and gain graphs (Q2122673) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- The chromatic number of signed graphs with bounded maximum average degree (Q2143044) (← links)
- On cospectrality of gain graphs (Q2148848) (← links)
- On relative clique number of triangle-free planar colored mixed graphs (Q2169979) (← links)
- The number of switching isomorphism classes of signed graphs associated with particular graphs (Q2181213) (← links)
- Relative clique number of planar signed graphs (Q2181247) (← links)
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees (Q2200916) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- Colouring of \(S\)-labelled planar graphs (Q2225437) (← links)
- On the chromatic numbers of signed triangular and hexagonal grids (Q2234782) (← links)
- Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Hajós-like theorem for signed graphs (Q2408976) (← 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)
- Homomorphisms of binary Cayley graphs (Q2515600) (← links)
- Walk-powers and homomorphism bounds of planar signed graphs (Q2631091) (← links)
- On the signed chromatic number of some classes of graphs (Q2666564) (← links)
- On the pushable chromatic number of various types of grids (Q2686138) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- Relative Clique Number of Planar Signed Graphs (Q2795959) (← links)
- Signed Graphs and Geometry (Q3189109) (← links)
- (Q3300693) (← links)
- Coloring problem of signed interval graphs (Q4997206) (← links)
- Non-isomorphic signatures on some generalised Petersen graph (Q5061676) (← links)
- SIGNED COMPLETE GRAPHS ON SIX VERTICES AND THEIR FRUSTRATION INDICES (Q5076082) (← links)
- (Q5089181) (← links)
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
- (Q5299043) (← links)
- (Q5419988) (← links)
- On Cartesian products of signed graphs (Q5896107) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- Packing Signatures in Signed Graphs (Q6057805) (← links)
- Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem (Q6080558) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs (Q6161257) (← links)
- The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree (Q6172314) (← links)
- (Q6185533) (← links)
- Homomorphisms to small negative even cycles (Q6201924) (← links)
