Treewidth versus clique number: induced minors
We prove that a hereditary class of graphs is $(\mathsf{tw}, ω)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, ω)$-bounded class.
math.CO↗
arXiv subjects
Publications and source records attributed to Djordje Vasić.
We prove that a hereditary class of graphs is $(\mathsf{tw}, ω)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, ω)$-bounded class.