Antisymmetric Flows and Strong Colourings of Oriented Graphs
摘要
We define the notions of strong-oriented colouring and
antisymmetric-flow. An antisymmetric-flow is a flow with values
in an additive abelian group which uses no opposite elements of
the group. We prove that the strong-oriented chromatic number (as
the modulo version of oriented chromatic number) is bounded for
planar graphs. We list several open problems analogous to those
for nowhere-zero flows.
∼Andre Raspaud教授演講摘要∼