Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A. Brandstädt, D. Kratsch, On the restriction of some NP-complete graph problems to permutation graphs, Report N/84/80, Friedrich-Schiller-Universität Jena, appeared in FCT'85, LNCS 199, 53–62
2. A. Brandstädt, J. Spinrad, L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congressus Numerantium Vol. 58, 1987, 165–174
3. S. Chaiken, D.J. Kleitman, M. Saks, J. Shearer, Covering Regions by Rectangles, SIAM J. Alg. Discr. Math. 1981, 394–410
4. G. Chaty, M. Chein, Ordered matchings and matchings without alternating cycles in bipartite graphs, Utilitas Mathematica 16, 1979, 183–187
5. M. Chein, M. Habib, The jump number of dags and posets: an introduction, Ann. Discr. Math. 9, 1980, 189–194
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献