Graph Operations on Clique-Width Bounded Graphs
Data Structures and Algorithms
2016-06-07 v3 Discrete Mathematics
Abstract
Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width and NLC-width under various graph operations and graph transformations. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs.
Cite
@article{arxiv.cs/0701185,
title = {Graph Operations on Clique-Width Bounded Graphs},
author = {Frank Gurski},
journal= {arXiv preprint arXiv:cs/0701185},
year = {2016}
}
Comments
30 pages, to appear in "Theory of Computing Systems"