搜索结果: 1-1 共查到“数学 Packing six T-joins”相关记录1条 . 查询时间(0.255 秒)
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-cuts of G have the same parity and the size of every T-cut is at least k, then G contains k edge-disj...