← 研踪 PaperTrailarXiv:2611.23576 · v1
Proper thinness at most 2: threshold and trivially perfect graphs
首次提交 2026-11-18 06:22
版本更新 2026-11-18 06:22
雷达观测 2026-11-19 19:08
摘要
The proper thinness of a graph is a parameter that generalizes proper interval graphs: the graphs of proper thinness 1 are exactly the proper interval graphs. The complexity of computing it is open even for cographs. In this paper we study it on two subclasses of cographs: threshold graphs and trivially perfect graphs. For threshold graphs, we show that the proper thinness is 1 if the graph is claw-free and 2 otherwise. For trivially perfect graphs, we characterize those of proper thinness at most 2 in three ways: structurally, through two properties of strongly consistent solutions that we call staggered and boundary; algorithmically, with a linear-time algorithm that decides whether the proper thinness is at most 2; and by forbidden induced subgraphs, showing that the and the lotus are exactly the minimal obstructions.
作者备注:43 pages, 7 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 06:22 · 最新观测版本
Proper thinness at most 2: threshold and trivially perfect graphs
The proper thinness of a graph is a parameter that generalizes proper interval graphs: the graphs of proper thinness 1 are exactly the proper interval graphs. The complexity of computing it is open even for cographs. In this paper we study it on two subclasses of cographs: threshold graphs and trivially perfect graphs. For threshold graphs, we show that the proper thinness is 1 if the graph is claw-free and 2 otherwise. For trivially perfect graphs, we characterize those of proper thinness at most 2 in three ways: structurally, through two properties of strongly consistent solutions that we call staggered and boundary; algorithmically, with a linear-time algorithm that decides whether the proper thinness is at most 2; and by forbidden induced subgraphs, showing that the and the lotus are exactly the minimal obstructions.
查看此版本解读 →查看此版本原文 ↗