条形图:实例和反例
Stick graphs: examples and counter-examples
摘要:
网格交图是平面内垂直线段和水平线段的交图。当垂直段和水平段的底端和左端分别属于一条负斜率的线时,该图称为棒形图。关于棒图的结果很少:只有少数几类棒图被识别;识别棒图是一个开放的问题;甚至构建不是棒图的图的例子也是相当棘手的。本文首先证明了圆图和圆弧图的补图是棒图。然后,我们提出了两个证书,允许决定一个图是不是一个棒图,并使用它们来建立新的例子非棒图。事实证明,这些不粘图的例子,以及所有来自文献的例子,都有很长的洞。因此,我们也调查弦网格相交图的层次结构中的类围绕棒图。
英文摘要:
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph is called a Stick graph. Very few results exist on Stick graphs: only small classes of Stick graphs have been identified; recognizing Stick graphs is an open problem; and even building examples of graphs that are not Stick graphs is quite tricky. In this paper, we first prove that the complements of circle graphs and of circular arc graphs are Stick graphs. Then, we propose two certificates allowing to decide that a graph is not a Stick graph, and use them to build new examples of non-Stick graphs. It turns out that these examples of non-Stick graphs, as well as all those from literature, have long holes. We thus also investigate the place of chordal grid intersection graphs in the hierarchy of classes built around Stick graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。