Graphical representations of clutters.
Michael Dinitz, Jonah M. Gold, Thomas C. Sharkey, Lorenzo Traldi · 2010
We discuss the use of K-terminal networks to represent arbitrary clutters. A given clutter has many di¤erent representations, and there does not seem to be any set of simple transformations that can be used to transform one representation of a clutter into any other. We observe that for t 2 the class of clutters that can be represented using no more than t terminals is closed under minors, and has in…nitely many forbidden minors. 1.