Parikh word representability of bipartite permutation graphs
From MaRDI portal
Publication:2185746
DOI10.1016/j.dam.2019.12.005zbMath1441.05165arXiv1812.10251OpenAlexW2997844190WikidataQ126526660 ScholiaQ126526660MaRDI QIDQ2185746
Zhen Chuan Ng, Zi Jing Chern, Muhammad Javaid, Wen Chean Teh
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10251
Combinatorics on words (68R15) Permutations, words, matrices (05A05) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Parikh word representable graphs and morphisms ⋮ Critical properties of bipartite permutation graphs ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Erasure and error correcting ability of Parikh matrices
Cites Work
- Unnamed Item
- On a conjecture about Parikh matrices
- Words and graphs
- Characterizing intersection classes of graphs
- Bipartite permutation graphs
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Order of weak \(M\)-relation and Parikh matrices
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Interval \(k\)-graphs and orders
- Structural properties of word representable graphs
- A sharpening of the Parikh mapping
- Computing the Minimum Fill-In is NP-Complete
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- On the Switch Markov Chain for Perfect Matchings
- Interval bigraphs and circular arc graphs
- Every planar graph is the intersection graph of segments in the plane
- On Core Words and the Parikh Matrix Mapping
- Statistical problems involving permutations with restricted positions
- On Context-Free Languages
This page was built for publication: Parikh word representability of bipartite permutation graphs
