On flows in bidirected graphs

DOI10.1016/j.disc.2004.06.023zbMath1073.05033OpenAlexW2167804572MaRDI QIDQ2568493

Cun-Quan Zhang, Rui Xu

Publication date: 10 October 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.023

zbMATH Keywords

integer flowsbidirected \(k\)-flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (26)

Characteristic flows on signed graphs and short circuit covers ⋮ Circuit Covers of Signed Graphs ⋮ Circuit \(k\)-covers of signed graphs ⋮ Zero-sum flows in regular graphs ⋮ Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs ⋮ Multiple weak 2-linkage and its applications on integer flows of signed graphs ⋮ Nowhere-zero flows on tensor products of signed graphs ⋮ Nowhere-Zero Flows on Signed Eulerian Graphs ⋮ Nowhere-zero flows on signed wheels and signed fans ⋮ Flows on Signed Graphs without Long Barbells ⋮ Circular flow on signed graphs ⋮ Nowhere-zero 15-flow in 3-edge-connected bidirected graphs ⋮ Signed Graphs: From Modulo Flows to Integer-Valued Flows ⋮ Flows in 3-edge-connected bidirected graphs ⋮ Nowhere-zero flow on some products of signed graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flow-contractible configurations and group connectivity of signed graphs ⋮ Flows on flow-admissible signed graphs ⋮ Remarks on nowhere-zero flows in signed cubic graphs ⋮ Circuit Covers of Signed Eulerian Graphs ⋮ Signed analogue of general Kotzig-Lovász decomposition ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ Circular flow number of highly edge connected signed graphs ⋮ Nowhere-zero flows on signed regular graphs ⋮ Flows of 3-edge-colorable cubic signed graphs

Cites Work

• Unnamed Item
• Nowhere-zero integral flows on a bidirected graph
• Nowhere-zero integral chains and flows in bidirected graphs
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• A Note on Sub-Eulerian Graphs
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials
• 25 pretty graph colouring problems

This page was built for publication: On flows in bidirected graphs