CHARACTERIZATION OF THE GRAPHS WITH BOXICITY LESS-THAN-OR-EQUAL-TO 2

被引：6
|
作者：
QUEST, M
WEGNER, G
机构：
[1] Universität Dortmund, Institut für Mathematik, 4600 Dortmund 50
来源：
DISCRETE MATHEMATICS | 1990年 / 81卷 / 02期
关键词：
D O I：
10.1016/0012-365X(90)90151-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The intersection graph of a family M of sets has the sets in M as vertices and an edge between two sets iff they have nonempty intersection. Following Roberts [4] the boxicity b(G) of a graph G is defined as the smallest d such that G is the intersection graph of boxes in Euclidean d-space, i.e. parallelepipeds with edges parallel to the coordinate axes. In this paper we will give a combinatorial characterization of the graphs with b(G)≤2, called boxicity 2-graphs, by means of the arrangement of zeros and ones in special matrices attached to the graph. © 1990.
引用
收藏
页码：187 / 192
页数：6
相关论文
共 50 条
12345