Circular flow on signed graphs

DOI10.1016/j.jctb.2011.02.007zbMath1408.05068OpenAlexW2032431189MaRDI QIDQ651035

Xuding Zhu, Andre Raspaud

Publication date: 8 December 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.007

zbMATH Keywords

signed graphbidirected graphcircular flow number

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Flows in graphs (05C21)

Related Items (27)

The chromatic spectrum of signed graphs ⋮ Shortest circuit covers of signed graphs ⋮ Flow number and circular flow number of signed cubic graphs ⋮ Characteristic flows on signed graphs and short circuit covers ⋮ Flows in signed graphs with two negative edges ⋮ Nowhere-zero unoriented 6-flows on certain triangular graphs ⋮ Circuit Covers of Signed Graphs ⋮ The difference between the circular and the integer flow number of bidirected graphs ⋮ Hajós-like theorem for signed graphs ⋮ Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs ⋮ Multiple weak 2-linkage and its applications on integer flows of signed graphs ⋮ Circular zero-sum \(r\)-flows of regular graphs ⋮ Nowhere-Zero Flows on Signed Eulerian Graphs ⋮ Nowhere-zero flows on signed wheels and signed fans ⋮ Flows on Signed Graphs without Long Barbells ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flow-contractible configurations and group connectivity of signed graphs ⋮ Remarks on nowhere-zero flows in signed cubic graphs ⋮ Nowhere-Zero Flows in Signed Series-Parallel Graphs ⋮ Zero-sum 6-flows in 5-regular graphs ⋮ Flow polynomials of a signed graph ⋮ Integer Flows and Modulo Orientations of Signed Graphs ⋮ Nowhere-zero flows on signed regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Nowhere-zero integral flows on a bidirected graph
• Nowhere-zero integral chains and flows in bidirected graphs
• Signed graphs
• Orientation of signed graphs
• Bounds of the number of disjoint spanning trees
• The circular flow number of a 6-edge connected graph is less than four
• On flows in bidirected graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Minimum partition of a matroid into independent subsets
• Circular chromatic number: A survey

This page was built for publication: Circular flow on signed graphs