Antisymmetric flows and edge-connectivity

DOI10.1016/S0012-365X(03)00301-7zbMath1031.05062OpenAlexW2084454470MaRDI QIDQ1422419

Matt DeVos, Jaroslav Nešetřil, Andre Raspaud

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00301-7

zbMATH Keywords

antisymmetric flows: edge-connectivity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (4)

Additive bases and flows in graphs ⋮ Additive Bases and Flows in Graphs ⋮ Antisymmetric flows and strong oriented coloring of planar graphs ⋮ A note on antisymmetric flows in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Nowhere-zero 6-flows
• Antisymmetric flows and strong colourings of oriented graphs
• Good and semi-strong colorings of oriented planar graphs
• Antisymmetric flows and strong oriented coloring of planar graphs
• Bounds of the number of disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• The chromatic number of oriented graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Antisymmetric flows and edge-connectivity