搜索结果: 1-1 共查到“理学 weighted graphs”相关记录1条 . 查询时间(0.328 秒)
Tuza conjectured that for every graph G, the maximum size of a set of edge-disjoint triangles and minimum size of a set of edges meeting all triangles, satisfy 2.