Parikh word representability of bipartite permutation graphs (Q2185746)

From MaRDI portal
Revision as of 00:50, 25 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126526660, #quickstatements; #temporary_batch_1719272490319)





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
    0 references
    0 references