Add to ORKGsummary:We present an overview of the theory of nowhere zero flows, in particular the duality of flows and colorings, and the extension to antiflows and strong oriented colorings. As the main result, we find the asymptotic relation between oriented and strong oriented chromatic number
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
Abstract. We present an overview of the theory of nowhere zero flows, in particular the duality of f...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping...
International audienceWe prove that any orientation of a graph without bridges and directed 2-edge-c...
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mappin...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without sel...
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mappin...
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
Abstract. We present an overview of the theory of nowhere zero flows, in particular the duality of f...
summary:We present an overview of the theory of nowhere zero flows, in particular the duality of flo...
AbstractAn (oriented) graph H is said to be Fk(k ≥ 2) iff there exists an integer flow in H with all...
Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping...
International audienceWe prove that any orientation of a graph without bridges and directed 2-edge-c...
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mappin...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
International audienceLet M be an additive abelian group. An M-strong-oriented coloring of an orient...
An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without sel...
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mappin...
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
International audienceA strong oriented k-coloring of an oriented graph G is a homomorphism f from G...
AbstractFor every positive integer k, we present an oriented graph Gk such that deleting any vertex ...