Parikh word representability of bipartite permutation graphs (Q2185746): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:27, 2 February 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
