Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Minimal obstructions for polarity, monopolarity, unipolarity and $(s,1)$-polarity in generalizations of cographs (2203.04953v2)

Published 9 Mar 2022 in math.CO and cs.DM

Abstract: It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of $P_4$-reducible graphs. In this work, we prove that also when restricted to the classes of $P_4$-sparse graphs and $P_4$-extendible graphs (both of which extend $P_4$-reducible graphs) every hereditary property can be characterized by finitely many minimal obstructions. We present complete lists of $P_4$-sparse and $P_4$-extendible minimal obstructions for polarity, monopolarity, unipolarity, and $(s,1)$-polarity, where $s$ is a positive integer. In parallel to the case of $P_4$-reducible graphs, all the $P_4$-sparse minimal obstructions for these hereditary properties are cographs.

Citations (1)

Summary

We haven't generated a summary for this paper yet.