Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Subgroup Switching of Skew Gain Graphs
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 5.23 |
In this paper we consider a connection between switching (of undirected graphs), and the notions of NLC-width, cliquewidth and treewidth. In particular, we show that the NLC-widths and the cliquewidths of two graphs in a switching class are at most a constant factor apart (2 for the former, 4 for the latter). A similar result can be shown not to hold for treewidth: it is easy to find a switching classes in which the distance between the lowest treewidth and the highest is dependent on the number of vertices of the graph. We also show that for NLC-width every width between the lowest and the highest of the switching class is attained by some graph in that switching class. We prove that this also holds for treewidth.