INTERVAL COMPETITION GRAPHS OF SYMMETRICAL DIGRAPHS

被引：13
|
作者：
LUNDGREN, JR [1 ]
RASMUSSEN, CW [1 ]
MAYBEE, JS [1 ]
机构：
[1] UNIV COLORADO, BOULDER, CO 80309 USA
来源：
DISCRETE MATHEMATICS | 1993年 / 119卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(93)90121-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The competition graph of a loopless symmetric digraph H is the two-step qraph, S2(H). Necessary and sufficient conditions on H are given for S2(H) to be interval or unit interval. These are useful properties when application requires that the competition graph be efficiently colorable. Computational aspects are discussed, as are related open problems.
引用
收藏
页码：113 / 122
页数：10
相关论文
共 50 条
12345