default search action

combined dblp search
author search
venue search
publication search

ask others

"Parikh word representability of bipartite permutation graphs."

Wen Chean Teh et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2019.12.005

access: closed

type: Journal Article

metadata version: 2020-07-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/TehNJC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/TehNJC20
Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid, Zi Jing Chern:
Parikh word representability of bipartite permutation graphs. Discret. Appl. Math. 282: 208-221 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.