Parikh word representability of bipartite permutation graphs (Q2185746): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2019.12.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2019.12.005 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parikh word representability of bipartite permutation graphs |
scientific article |
Statements
Parikh word representability of bipartite permutation graphs (English)
0 references
5 June 2020
0 references
Parikh word representable graph
0 references
bipartite permutation graph
0 references
Parikh matrices
0 references
diameter
0 references
Hamiltonian cycle
0 references
