### Abstract

Suppose that s_{1}, s_{2}, s_{3}, s_{4} are vertices of a graph, that each edge has a real‐valued capacity, and q_{ii}(1 ⩽ i < j ⩽ 4) are six demands. There exist flows from s_{i} to s_{j} of value q_{ij}(1 ⩽ i < j ⩽ 4), such that the total flow through each edge does not exceed its capacity, if and only if the obvious connectivity requirements are satisfied. This result extends Hu's 2‐commodity flow theorem.

Original language | English (US) |
---|---|

Pages (from-to) | 79-86 |

Number of pages | 8 |

Journal | Networks |

Volume | 10 |

Issue number | 1 |

DOIs | |

State | Published - Jan 1 1980 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications

## Cite this

Seymour, P. D. (1980). Four‐terminus flows.

*Networks*,*10*(1), 79-86. https://doi.org/10.1002/net.3230100108