Parikh word representability of bipartite permutation graphs (Q2185746)

From MaRDI portal
Revision as of 10:20, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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