Bipartite permutation graphs
- 1 December 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 18 (3), 279-292
- https://doi.org/10.1016/s0166-218x(87)80003-3
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Domination in permutation graphsJournal of Algorithms, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- On testing isomorphism of permutation graphsNetworks, 1981
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- An NP-hard problem in bipartite graphsACM SIGACT News, 1975
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967