Affiliation
发表于 2025-4-1 04:46:48
Schriften des Deutschen Orient - Institutstime on a class of graphs of clique-width at most . in which for every graph . an expression defining it can be constructed in .(.(|.|,|.|)) time. By the above this applies in particular to (.,. – 4) graphs, ..-tidy graphs and ..-sparse graphs with . linear..Finally, we show that the above results c