Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Finding Hamiltonian circuits in proper interval graphs;Bertossi;Inform. Process. Lett.,1983
2. Hamiltonian circuits in interval graph generalizations;Bertossi;Inform. Process. Lett.,1986
3. Special graph classes — a survey;Brandstädt,1993
4. Bipartite permutation graphs;Spinrad;Discrete Appl. Math.,1987
5. Complement reducible graphs;Corneil;Discrete Appl. Math.,1981
Cited by
99 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献