Author:
Babel Luitpold,Olariu Stephan
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Babel, L., Olariu, S.: On the structure of graphs with few P4s. Discrete Applied Mathematics 84, 1–13 (1998)
2. Baumann, S.: A linear algorithm for the homogeneous decomposition of graphs. Report No. M-9615. Zentrum Mathematik, Technische Universität München (1996)
3. Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163–174 (1981)
4. Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Applied Mathematics 9, 27–39 (1984)
5. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14, 926–934 (1985)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S;International Journal of Foundations of Computer Science;1999-09
2. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width;Graph-Theoretic Concepts in Computer Science;1998