On Languages Describing Large Graph Classes
Formal Languages and Automata Theory
2026-04-22 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2604.19719,
title = {On Languages Describing Large Graph Classes},
author = {Henning Fernau and Pamela Fleischmann and Kevin Mann and Silas Cato Sacher},
journal= {arXiv preprint arXiv:2604.19719},
year = {2026}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2411.03274