On Languages Describing Large Graph Classes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915947816681472 |
|---|---|
| author | Fernau, Henning Fleischmann, Pamela Mann, Kevin Sacher, Silas Cato |
| author_facet | Fernau, Henning Fleischmann, Pamela Mann, Kevin Sacher, Silas Cato |
| contents | In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of patterns (given by the languages' words) defining the edges in the graph. In particular, we investigate famous languages like the palindromes, copy-words, Lyndon words, and Dyck words to represent all graphs or specific graph classes by restricting these languages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_19719 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Languages Describing Large Graph Classes Fernau, Henning Fleischmann, Pamela Mann, Kevin Sacher, Silas Cato Formal Languages and Automata Theory 68Q45 F.4 In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of patterns (given by the languages' words) defining the edges in the graph. In particular, we investigate famous languages like the palindromes, copy-words, Lyndon words, and Dyck words to represent all graphs or specific graph classes by restricting these languages. |
| title | On Languages Describing Large Graph Classes |
| topic | Formal Languages and Automata Theory 68Q45 F.4 |
| url | https://arxiv.org/abs/2604.19719 |