Parikh word representability of bipartite permutation graphs (Q2185746): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2997844190 / rank
 
Normal rank

Revision as of 22:34, 19 March 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
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references