Families of Induced Trees and Their Intersection Graphs

Q3 Computer Science

Electronic Notes in Theoretical Computer Science Pub Date : 2019-08-30 DOI:10.1016/j.entcs.2019.08.024

Pablo De Caria

引用次数: 0

Abstract

This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph.

查看原文本刊更多论文

诱导树族及其交图

本文的灵感来自于众所周知的弦图的表征，即树的子树的相交图。考虑任意图的诱导树族，并证明了它们的识别是np完全的。这个事实的一个结果是弦图的团树的概念不能被广泛推广。最后，我们考虑到每个图都是二部图的诱导树的交点图，并刻画了当我们对主二部图施加限制时出现的一些类。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.