arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.12140math.COcs.DMcs.DS
收藏

脊椎动物区间图

Vertebrate interval graphs

Rain Jiang, Kai Jiang, Minghui Jiang

摘要:

脊椎动物区间图是一个区间图,其中一组独立顶点的最大大小等于最大团的数量。对于任意固定的$v \ge 1$,存在一个多项式时间算法来判定脊椎区间图是否允许顶点划分为爪数至多为$v$的两个诱导子图.特别地,当$v = 2$时,一个脊椎区间图是否可以划分为两个适当的区间图可以在多项式时间内决定。

英文摘要:

A vertebrate interval graph is an interval graph in which the maximum size of a set of independent vertices equals the number of maximal cliques. For any fixed $v \ge 1$, there is a polynomial-time algorithm for deciding whether a vertebrate interval graph admits a vertex partition into two induced subgraphs with claw number at most $v$. In particular, when $v = 2$, whether a vertebrate interval graph can be partitioned into two proper interval graphs can be decided in polynomial time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑