加载中…
We prove that for every fixed integer and every planar graph , the class of -induced-minor-free and -induced-subgraph-free graphs has polylogarithmic tree-independence number. This is a weakening of a conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht.

生成讲解博客的中文版本

生成AI智能校验的中文版本