Assume that f (v 2 ) = j for some j ? {?, 1}. Start by switching some of v 5 ,
choose some i ? N ?(v 4 v 8 ) (f (v 4 )) \ {?, j} and set f (v 8 ) = i. According to Observation 6.5, there is an sp-homomorphism g of the signed path induced by the vertices v 2 ,
Up to the left/right symmetry, we may also assume that f (v 4 ) ? {f (v 1 ), f (v 2 )}, i.e. {f (v 1 ), f (v 2 )} = {f (v 3 ), f (v 4 )}. We here consider two subcases: (a) f (v 1 ) = f (v 3 ) and f ,
, Without loss of generality, assume f (v 1 ) = f (v 3 ) = ? and f (v 2 ) = f (v 4 ) = 1. Start by switching v 5
, Now choose i ? N ?(v 2 v 6 ) (1)\ {?}, j ? N ?(v 4 v 8 ) (1) \ {?, i} and set f (v 6 ) = i and f (v 8 ) = j
, if needed) to make sure that ?(v 2 v 6 ) = + and ?(v 4 v 8 ) = ?. Up to exchanging (v 1 , v 5 ) with (v 3 , v 7 ), we may assume that ?(v 5 v 6 ) = ?(v 5 v 8 ) and ?(v 6 v 7 ) = ?, ?, then set f, vol.3
, Without loss of generality, assume f (v 1 ) = f (v 4 ) = ? and f (v 2 ) = f (v 3 ) = 1. Start by switching some of v 5
, if ?(v 6 v 7 ) = +, and f (v 7 ) = 4 otherwise, vol.2
Homomorphisms of edge-colored graphs and coxeter groups, Journal of Algebraic Combinatorics, vol.8, issue.1, pp.5-13, 1998. ,
Homomorphism bounds and edgecolourings of K 4 -minor-free graphs, Journal of Combinatorial Theory, Series B, vol.124, pp.128-164, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01520741
, Pushable chromatic number of graphs with degree constraints. Discrete Mathematics, p.2020
URL : https://hal.archives-ouvertes.fr/hal-02373515
Analogues of cliques for (m, n)-colored mixed graphs, Graphs and Combinatorics, vol.33, issue.4, pp.735-750, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01078218
Classification of edge-critical underlying absolute planar cliques for signed graphs, Australasian Journal of Combinatorics, vol.77, issue.1, pp.117-135, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-01919007
The complexity of signed graph and edge-coloured graph homomorphisms, Discrete Mathematics, vol.340, issue.2, pp.223-235, 2017. ,
Edge-switching homomorphisms of edge-coloured graphs, Discrete mathematics, vol.309, issue.18, pp.5540-5546, 2009. ,
Relative clique number of planar signed graphs (accepted), Discrete Applied Mathematics ,
Packing odd circuit covers: A conjecture, 2005. ,
Induced subgraphs of hypercubes and a proof of the sensitivity conjecture, Annals of Mathematics, vol.190, issue.3, pp.949-955, 2019. ,
, Sensitivity lower bounds from linear dependencies. Electronic Colloquium on Computational Complexity (ECCC), vol.27, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02429358
Homomorphisms of 2-edge-colored graphs, Electronic Notes in Discrete Mathematics, vol.30, pp.33-38, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00266540
Homomorphisms of 2-edge-colored graphs, Discrete Applied Mathematics, vol.158, issue.12, pp.1365-1379, 2010. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00266540
Homomorphisms of planar signed graphs to signed projective cubes, Discrete Mathematics & Theoretical Computer Science, vol.15, issue.3, pp.1-12, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00876298
Homomorphisms of signed graphs, Journal of Graph Theory, vol.79, issue.3, pp.178-212, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00991796
Walk-powers and homomorphism bounds of planar signed graphs, Graphs and Combinatorics, vol.32, issue.4, pp.1505-1519, 2016. ,
Homomorphisms of signed graphs: An update, European Journal of Combinatorics, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02429415
Characterisations and examples of graph classes with bounded expansion, European Journal of Combinatorics, vol.33, issue.3, pp.350-373, 2012. ,
Homomorphisms of 2-edge-colored triangle-free planar graphs, Journal of Graph Theory, vol.85, issue.1, pp.258-277, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01376130
Signed graphs, Discrete Applied Mathematics, vol.4, issue.1, pp.47-74, 1982. ,
URL : https://hal.archives-ouvertes.fr/hal-02429415