Graphical representations of clutters

被引:0
|
作者
Dinitz, M. H. [1 ]
Gold, J. M. [1 ]
Sharkey, T. C. [1 ]
Traldi, L. [1 ]
机构
[1] Lafayette Coll, Dept Math, Easton, PA 18042 USA
关键词
MINORS;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We discuss the use of K-terminal networks to represent arbitrary clutters. A given clutter has many different 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 infinitely many forbidden minors.
引用
收藏
页码:303 / 320
页数:18
相关论文
共 50 条