Skip to Main content Skip to Navigation
New interface
Journal articles

Homomorphisms of signed graphs

Abstract : A signed graph [G, Σ] is a graph G together with an assignment of signs + and − to all the edges of G where Σ is the set of negative edges. Furthermore [G, Σ 1 ] and [G, Σ 2 ] are considered to be equivalent if the symmetric difference of Σ 1 and Σ 2 is an edge cut of G. Naturally arising from matroid theory, several notions of graph theory, such as the theory of minors and the theory of nowhere-zero flows, have been already extended to signed graphs. In an unpublished manuscript, B. Guenin introduced the notion of signed graph homomorphisms where he showed how some well-known conjectures can be captured using this notion. A signed graph [G, Σ] is said to map to [H, Σ 1 ] if there is an equivalent signed graph [G, Σ ] of [G, Σ] and a mapping ϕ : V (G) → V (H) such that (i) if xy ∈ E(G) then ϕ(x)ϕ(y) ∈ E(H) and (ii) xy ∈ Σ if and only if ϕ(x)ϕ(y) ∈ Σ 1. The chromatic number of a signed graph [G, Σ] can then be defined as the smallest order of a homomorphic image of [G, Σ]. Capturing the notion of graph homomorphism order, signed graph homomorphisms provide room for extensions and strengthenings of most homomorphism and coloring theories on graphs. Thus this paper is the first general study of signed graph homomorphisms. In this work our focus would be on the relation of homomorphisms of signed graphs with minors of signed graphs. After a thorough introduction to the concept we show that the notion of signed graph homomorphism on the set of signed graphs whose underlying graph is bipartite already captures the standard notion of graph homomorphism. We prove that the largest planar signed clique is of order 8. For the maximum chromatic number of planar signed graphs we give the lower bound of 10 and the upper bound of 48. We determine this maximum for some other families such as outerplanar signed graphs. Finally, reformulating Hadwiger's conjecture in the language of homomorphism of signed graphs whose underlying graph is bipartite, we show that while some stronger form of the conjecture holds for small chromatic number, such strengthening of the conjecture would not hold for large chromatic numbers. This could be regarded as a first indication that perhaps Hadwiger's conjecture only holds for small chromatic numbers.
Document type :
Journal articles
Complete list of metadata
Contributor : Eric Sopena Connect in order to contact the contributor
Submitted on : Friday, May 16, 2014 - 7:47:21 AM
Last modification on : Monday, October 17, 2022 - 1:42:58 PM

Links full text



Reza Naserasr, Edita Rollova, Eric Sopena. Homomorphisms of signed graphs. Journal of Graph Theory, 2015, 79 (3), pp.178-212. ⟨10.1002/jgt.21817⟩. ⟨hal-00991796⟩



Record views