The following pages link to On circular flows of graphs (Q2460626):
Displaying 15 items.
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Circular flow number of generalized Blanuša snarks (Q1946668) (← links)
- Contractible graphs for flow index less than three (Q2198393) (← links)
- (Q3155829) (← links)
- (Q3582519) (← links)
- (Q3737469) (← links)
- On the complexity of circulations (Q3740229) (← links)
- Construction of graphs with given circular flow numbers (Q4422617) (← links)
- On the Circular Area Signature for Graphs (Q4902165) (← links)
- The Set of Circular Flow Numbers of Regular Graphs (Q5495888) (← links)
- Spectral radius and edge‐disjoint spanning trees (Q6084711) (← links)