Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Bandelt, H.: Retracts of hypercubes. Journal of Graph Theory 8, 501–510 (1984)
2. Bandelt, H., Dählmann, A., Schütte, H.: Absolute retracts of bipartite graphs. Discrete Applied Mathematics 16, 191–215 (1987)
3. Bodlaender, H.: Achromatic number is NP-complete for cographs and interval graphs. Information Processing Letters 31, 135–138 (1989)
4. Chvátal, V., Hammer, P.: Aggregation of inequalities in integer programming. Technical Report STAN-CS-75-518, Stanford University, California (1975)
5. Corneil, D., Perl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM Journal on Computing 14, 926–934 (1985)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the fold thickness of graphs;Arabian Journal of Mathematics;2020-02-19
2. The word problem for free adequate semigroups;International Journal of Algebra and Computation;2014-09