A note on antisymmetric flows in graphs
From MaRDI portal
Publication:1041206
DOI10.1016/J.EJC.2009.05.005zbMath1208.05032OpenAlexW1979621260WikidataQ57601402 ScholiaQ57601402MaRDI QIDQ1041206
Jean-Sébastien Sereni, Tomáš Kaiser, Daniel Král', Zdeněk Dvořák
Publication date: 1 December 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.05.005
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nowhere-zero integral flows on a bidirected graph
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Antisymmetric flows and strong colourings of oriented graphs
- Antisymmetric flows and edge-connectivity
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- Homomorphism bounds for oriented planar graphs
- On the algebraic theory of graph colorings
- A correction to: On the algebraic theory of graph colorings
- Polyhedral decompositions of cubic graphs
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: A note on antisymmetric flows in graphs