International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g admits a homomorphism to the signed projective cube of dimension 2g - 1. Our main result is to show that for a given g, this conjecture is equivalent to the corresponding case (k = 2g) of a conjecture of Seymour claiming that every planar k-regular multigraph with no odd edge-cut of less than k edges is k-edge-colorabl
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
International audienceWe conjecture that every signed graph of unbalanced girth 2g, whose underlying...
International audienceA signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A reformulation of the four-color theorem is to say that K 4 is the smallest graph to which every pl...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightar...
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every si...
A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or nega...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
International audienceWe conjecture that every signed graph of unbalanced girth 2g, whose underlying...
International audienceA signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A reformulation of the four-color theorem is to say that K 4 is the smallest graph to which every pl...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightar...
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every si...
A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or nega...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
AbstractWe prove that a connected cographic matroid of a graph G is the bias matroid of a signed gra...
We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff...