Flows in 3-edge-connected bidirected graphs
From MaRDI portal
Publication:537628
DOI10.1007/S11464-011-0111-3zbMATH Open1226.05130OpenAlexW2031195661MaRDI QIDQ537628FDOQ537628
Authors: Xiao-Feng Wang, Erling Wei, Wenliang Tang
Publication date: 20 May 2011
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-011-0111-3
Recommendations
Combinatorial aspects of matroids and geometric lattices (05B35) Flows in graphs (05C21) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Signed graphs
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Nowhere-zero integral flows on a bidirected graph
- Orientation of signed graphs
- On flows in bidirected graphs
- Circular flow on signed graphs
- Combinatorial optimization. Theory and applications.
- Nowhere-zero integral chains and flows in bidirected graphs
Cited In (21)
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
- Nowhere-zero 15-flow in 3-edge-connected bidirected graphs
- On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
- Title not available (Why is that?)
- Vector flows and integer flows
- Nowhere-zero bases for the nullspace of the incidence matrices of graphs
- A new proof of validity of Bouchet's conjecture on Eulerian bidirected graphs
- Characteristic flows on signed graphs and short circuit covers
- The difference between the circular and the integer flow number of bidirected graphs
- Bounded-excess flows in cubic graphs
- Nowhere-zero flows on signed complete and complete bipartite graphs
- A flow theory for the dichromatic number
- Nowhere-zero integral chains and flows in bidirected graphs
- Nowhere-zero unoriented flows in Hamiltonian graphs.
- 3-flows with large support
- Remarks on nowhere-zero flows in signed cubic graphs
- Circuit covers of signed graphs
- A note on nowhere-zero 3-flows and \(Z_3\)-connectivity
- On flows in bidirected graphs
- On dihedral flows in embedded graphs
This page was built for publication: Flows in 3-edge-connected bidirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537628)