International audienceWe study the homomorphism relation between signed graphs where the underlying graph G is bipartite. We show that this notion captures the notions of chromatic number and graph homomorphisms. In particular we will study Hadwiger's conjecture in this setting. We show that for small values of the chromatic number there are natural strengthening of this conjecture but such extensions will not work for larger chromatic numbers
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
We investigate bounds on the chromatic number of a graph G de-rived from the nonexistence of homomor...
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed fo...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a sign...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
In [1] F. H a r a r y, D. Hsu and Z. Mi l le r have introduced the concepts of a bicomplete homomorp...
A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or nega...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
AbstractThis paper examines the effect of a graph homomorphism upon the chromatic difference sequenc...
The function that counts the number of proper colorings of a graph is the chromatic\ud polynomial. S...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
We investigate bounds on the chromatic number of a graph G de-rived from the nonexistence of homomor...
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed fo...
International audienceWe study the homomorphism relation between signed graphs where the underlying ...
International audienceA signed graph [G, Σ] is a graph G together with an assignment of signs + and ...
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a sign...
International audienceA signed graph $(G, \sigma)$ is a graph $G$ along with a function $\sigma: E(G...
In [1] F. H a r a r y, D. Hsu and Z. Mi l le r have introduced the concepts of a bicomplete homomorp...
A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or nega...
A signed graph (G, σ) is a graph G together with an assignment σ : E(G) → {+, −}. The notion of homo...
We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite an...
AbstractWe continue the study initiated in “Signed graph coloring” of the chromatic and Whitney poly...
International audienceWe conjecture that every planar signed bipartite graph of unbalanced girth 2g ...
AbstractThis paper examines the effect of a graph homomorphism upon the chromatic difference sequenc...
The function that counts the number of proper colorings of a graph is the chromatic\ud polynomial. S...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
We investigate bounds on the chromatic number of a graph G de-rived from the nonexistence of homomor...
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed fo...