Some results on Parikh word representable graphs and partitions
From MaRDI portal
Publication:2423402
Recommendations
Cites work
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A sharpening of the Parikh mapping
- A walk through combinatorics. An introduction to enumeration and graph theory
- BINARY AMIABLE WORDS
- Core words and Parikh matrices
- Dominator sequences in bipartite graphs
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- On Context-Free Languages
- On core words and the Parikh matrix mapping
- On fair words
- Parikh matrices and amiable words
- Structural properties of word representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
Cited in
(9)- Parikh word representable graphs and morphisms
- On exploring the topological aspects of the chemical structure of the nanotube \(HAC_5C_7[w,t]\)
- Parikh word representability of bipartite permutation graphs
- Certain distance-based topological indices of Parikh word representable graphs
- Properties of \(m\)-bonacci-sum graphs
- Structural properties of word representable graphs
- Erasure and error correcting ability of Parikh matrices
- BINARY AMIABLE WORDS
- Wiener-type indices of Parikh word representable graphs
This page was built for publication: Some results on Parikh word representable graphs and partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423402)