Refining the Hierarchies of Classes of Geometric Intersection Graphs

详细信息    查看全文

• 作者：Sergio Cabello¹ ; ^{sergio.cabello@fmf.uni-lj.si" class="auth_mail" title="E-mail the corresponding author}
• 关键词：String graphs ; segment graphs ; disk graphs ; intersection graphs
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：54
• 期：Complete
• 页码：223-228
• 全文大小：185 K

文摘

We analyse properties to show the strict containment between some natural classes of geometric intersection graphs. For example, we show that, for each integer k≥1$k\ge 1$, the class of intersection graphs of segments with k   different lengths is a strict subclass of the class of intersection graphs of segments with k+1$k+1$ different lengths, and the class of outer-segment graphs is a strict subclass of the class of outer-string graphs.