International audienceWe conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1. 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-colorable. To this end, we exhibit several properties of signed projective cubes and establish a folding lemma for planar even signed graphs
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...
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a sign...
International audienceWe conjecture that every signed graph of unbalanced girth 2g, whose underlying...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
International audienceA signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightar...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every si...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
Hu and Li investigate the signed graph version of Erd$\ddot{\mathrm{o}}$s problem: Is there a consta...
A reformulation of the four-color theorem is to say that K 4 is the smallest graph to which every pl...
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...
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a sign...
International audienceWe conjecture that every signed graph of unbalanced girth 2g, whose underlying...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
International audienceA signed graph $(G, \Sigma)$ is a graph $G$ and a subset $\Sigma$ of its edges...
AbstractA projective-planar signed graph has no two vertex-disjoint negative circles. We prove that ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A \emph{signed graph} $(G, \sigma)$ is a graph $G$ together with an assignment $\sigma:E(G) \rightar...
AbstractA signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative...
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every si...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
Hu and Li investigate the signed graph version of Erd$\ddot{\mathrm{o}}$s problem: Is there a consta...
A reformulation of the four-color theorem is to say that K 4 is the smallest graph to which every pl...
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...
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a sign...