Pages that link to "Item:Q1045035"

The following pages link to Edge-switching homomorphisms of edge-coloured graphs (Q1045035):

Displaying 19 items.

• Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
• Switching with more than two colours. (Q1427966) (← links)
• A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
• List homomorphism problems for signed trees (Q2111917) (← links)
• The chromatic number of signed graphs with bounded maximum average degree (Q2143044) (← links)
• Homomorphisms of signed graphs: an update (Q2225427) (← links)
• On the chromatic numbers of signed triangular and hexagonal grids (Q2234782) (← links)
• Complexity of vertex switching on edge-bicolored graphs (Q2294065) (← links)
• The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
• On homomorphisms of oriented graphs with respect to the push operation (Q2397542) (← links)
• On the signed chromatic number of some classes of graphs (Q2666564) (← links)
• (Q5089181) (← links)
• Homomorphisms of Signed Graphs (Q5265329) (← links)
• Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs (Q5272645) (← links)
• The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← 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)
• Graphs isomorphisms under edge-replacements and the family of amoebas (Q6133145) (← links)
• The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree (Q6172314) (← links)