paper

Treewidth versus clique number: induced minors

arXiv:2410.17979

Abstract

We prove that a hereditary class of graphs is -bounded if and only if the induced minors of the graphs from the class form a -bounded class.

Treewidth versus clique number: induced minors · wovepaper