搜索结果: 1-2 共查到“数学 Boxicity”相关记录2条 . 查询时间(0.211 秒)
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 ...
Boxicity of Line Graphs
Intersection graph Interval graph Boxicity Line graph,Edge graph Hypercube
2010/12/10
Boxicity of a graph H, denoted by box(H), is the mini-mum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in Rk. In this paper.