Scholarlink

The modification problems toward subclasses of claw-free graphs have been investigated a lot in recent years. Proper Helly circular-arc graph is an important subclass of claw-free graphs. In this paper, we give an \(O(k^8)\) vertex-kernel for proper Helly circular-arc vertex deletion, which is much better than the \(O(k^{88})\) vertex-kernel [LATIN 24]. Our kernelization is based on small graph enumeration and isomorphism, which may be helpful for other graph classes with large forbidden induced subgraphs.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Hanchun Yuan,
  • Zhen Zhang

摘要

The modification problems toward subclasses of claw-free graphs have been investigated a lot in recent years. Proper Helly circular-arc graph is an important subclass of claw-free graphs. In this paper, we give an \(O(k^8)\) vertex-kernel for proper Helly circular-arc vertex deletion, which is much better than the \(O(k^{88})\) vertex-kernel [LATIN 24]. Our kernelization is based on small graph enumeration and isomorphism, which may be helpful for other graph classes with large forbidden induced subgraphs.