搜索结果: 1-1 共查到“组合数学 Boxicity of graphs”相关记录1条 . 查询时间(0.046 秒)
Abstract: The boxicity of a graph $G=(V,E)$ is the smallest integer $k$ for which there exist $k$ interval graphs $G_i=(V,E_i)$, $1 \le i \le k$, such that $E=E_1 \cap...\cap E_k$. Scheinerman proved ...