搜索结果: 1-1 共查到“数学 Small 2,s-colorable graphs”相关记录1条 . 查询时间(0.046 秒)
Small (2,s)-colorable graphs without 1-obstacle representations
Small (2,s)-colorable graphs 1-obstacle representations
2011/3/4
An obstacle representation of a graph G is a set of points on the plane together with a set of polygonal obstacles that determine a visibility graph isomorphic to G. The obstacle number of G is the mi...