Parikh word representable graphs and morphisms

DOI10.1007/978-3-030-81508-0_30OpenAlexW3188900762MaRDI QIDQ832963FDOQ832963

Somnath Bera, Atulya K. Nagar, K. G. Subramanian, Nobin Thomas, Lisa Mathew

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Core words and Parikh matrices
• Parikh matrices and amiable words
• PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
• Title not available (Why is that?)
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• On Core Words and the Parikh Matrix Mapping
• On Context-Free Languages
• Title not available (Why is that?)
• Word-Representability of Line Graphs
• Words and graphs
• Title not available (Why is that?)
• Structural properties of word representable graphs
• Parikh word representability of bipartite permutation graphs
• Some results on Parikh word representable graphs and partitions
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• Parikh Matrices: Subword Indicators and Degrees of Ambiguity

Cited In (4)

• A comprehensive introduction to the theory of word-representable graphs
• Compact morphic directed acyclic word graphs
• Word-Representable Graphs: a Survey
• Solving computational problems in the theory of word-representable graphs

This page was built for publication: Parikh word representable graphs and morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832963)