Author:
Kijima Shuji,Otachi Yota,Saitoh Toshiki,Uno Takeaki
Funder
World-Leading Innovative R & D on Science and Technology, Japan
Grants-in-Aid for Scientific Research from Ministry of Education, Science and Culture, Japan
Japan Society for the Promotion of Science
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference30 articles.
1. Finding Hamiltonian circuits in interval graph generalizations;Bertossi;Inform. Process. Lett.,1986
2. A short proof that ‘ proper=unit’;Bogart;Discrete Math.,1999
3. On the restriction of some NP-complete graph problems to permutation graphs;Brandstädt,1985
4. Graph Classes: A Survey;Brandstädt,1999
5. On testing isomorphism of permutation graphs;Colbourn;Networks,1980
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献