Polynomial-time recognition of clique-width ≤3 graphs-Reference-Cited by-同舟云学术

Polynomial-time recognition of clique-width ≤3 graphs

Published:2012-04 Issue:6 Volume:160 Page:834-865
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Corneil Derek G.,Habib Michel,Lanlignel Jean-Marc,Reed Bruce,Rotics Udi

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference38 articles.

1. H.-J. Bandelt, A. D’Atri, M. Moscarini, H.M. Mulder, A. Schultze, Operations on distance-hereditary graphs, Tech. Report R. 226, Istituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche, 1988.

2. A tourist guide through treewidth;Bodlaender;Acta Cybernetica,1993

3. Transforming trees by successive local complementations;Bouchet;Journal of Graph Theory,1988

4. New graph classes of bounded clique-width;Brandstädt;Theory of Computing Systems,2005

5. Gem- and Co-Gem-free graphs have bounded clique-width;Brandstädt;International Journal of Foundations of Computer Science,2004

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Classes and Graph Decompositions;Locating Eigenvalues in Graphs;2022

2. Approximate the Clique-Width of a Graph Using Shortest Paths;Advances in Soft Computing;2021

3. Polynomial-time algorithm for isomorphism of graphs with clique-width at most three;Theoretical Computer Science;2020-06

4. Clique-Width for Graph Classes Closed under Complementation;SIAM Journal on Discrete Mathematics;2020-01

5. Bounding clique-width via perfect graphs;Journal of Computer and System Sciences;2019-09