11 papers
-word--representable Graphs
Duncan Adamson, Amanita Dietz, Pamela Fleischmann +2
This paper investigates the new notion of -word--repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between t…
On Languages Describing Large Graph Classes
Henning Fernau, Pamela Fleischmann, Kevin Mann +1
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…
(Sets of ) Complement Scattered Factors
Duncan Adamson, Pamela Fleischmann, Annika Huch
Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily…
Determining Factorial Speed Fast
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The speed of a graph class measures how many labeled graphs on vertices one can find in . This graph class complexity function is explicitly provided on graphc…
Tight Bounds for the Number of Absent Subsequences
Duncan Adamson, Pamela Fleischmann, Annika Huch +3
A {\em subsequence} of a word is a word that can be obtained by deleting some letters from while maintaining the relative order of the remaining letters, e.g., $\mathtt…
Word Chain Generators for Prefix Normal Words
Duncan Adamson, Moritz Dudey, Pamela Fleischmann +1
In 2011, Fici and Lipták introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the pre…