Contact graphs of line segments are NP-complete

被引：12
|
作者：
Hlineny, P
机构：
[1] Charles Univ, Dept Appl Math, CR-11800 Prague 1, Czech Republic
[2] Charles Univ, Fac Math & Phys, Inst Theoret Comp Sci, ITI, CR-11800 Prague, Czech Republic
来源：
DISCRETE MATHEMATICS | 2001年 / 235卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(00)00263-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of line segments plane are considered - it is proved that recognizing line-segment contact graphs, with degrees of 3 or more, is an NP-complete problem, even for planar graphs. This result contributes to the related research on recognition complexity of curve contact graphs (Hlineny J. Combin. Theory Ser. B 74 (1998) 87). (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：95 / 106
页数：12
相关论文
共 50 条
12345