| Article ID: | iaor1989644 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 1 |
| Start Page Number: | 25 |
| End Page Number: | 29 |
| Publication Date: | Feb 1989 |
| Journal: | Operations Research Letters |
| Authors: | Chopra Sunil |
Fulkerson characterized the blocking matrix to the incidence matrix of all spanning trees of the graph. This paper gives a simple constructive proof of this characterization using a minimum spanning tree algorithm. It also identifies all inequalities that are facets.