Graphs with minimum flow number 3 (Q2370388)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with minimum flow number 3 |
scientific article |
Statements
Graphs with minimum flow number 3 (English)
0 references
25 June 2007
0 references
The authors prove that the join of \(K_2\) and a graph \(G\) with no vertices of odd degree, and \(K_{2n+1,2n+1}\) for \(n\geq 1\) have a nowhere-zero \(3\)-flow.
0 references
nowhere-zero flow
0 references
