Graph Operations on Clique-Width Bounded Graphs
<|reference_start|>Graph Operations on Clique-Width Bounded Graphs: 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.<|reference_end|>
@article{gurski2007graph,
    title={Graph Operations on Clique-Width Bounded Graphs},
    author={Frank Gurski},
    journal={arXiv preprint arXiv:cs/0701185},
    year={2007},
    doi={10.1007/s00224-016-9685-1},
    archivePrefix={arXiv},
    eprint={cs/0701185},
    primaryClass={cs.DS cs.DM}
}