Polar permutation graphs are polynomial-time recognisable
| Başlık | Polar permutation graphs are polynomial-time recognisable |
| Publication Type | Journal Article |
| Year of Publication | 2013 |
| Authors | Ekim, T., P. Heggernes, and D. Meister |
| Journal | European Journal of Combinatorics |
| Volume | 34 |
| Pagination | 576–592 |