Every graph class of bounded cliquewidth and unbounded linear cliquewidth contains arbitrarily large tree-like induced subgraphs that MSO-transduce all trees and FO-transduce subdivisions of all binary trees.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.
citing papers explorer
-
Trees in graphs of large linear cliquewidth
Every graph class of bounded cliquewidth and unbounded linear cliquewidth contains arbitrarily large tree-like induced subgraphs that MSO-transduce all trees and FO-transduce subdivisions of all binary trees.
-
On the Complexity of Secluded Path Problems
New XP algorithm for Short Secluded Path parameterized by cliquewidth, FPT algorithms by neighborhood diversity and twin cover, and a polynomial-time algorithm for Shortest Secluded Path on unweighted graphs.