Risultati di ricerca
8 ore fa · Using this result, we prove that the class of planar graphs has underlying treewidth 3; the class of Ks,t -minor-free graphs has underlying treewidth s (for t ≥ max { s ,3}); and the class of Kt -minor-free graphs has underlying treewidth t −2. In general, we prove that a monotone class has bounded underlying treewidth if and only if it ...
