Josef Rukavicka

activity

20172026

most citedOn Number of Rich Words

8 citations · 28 across the 18 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Bijections in de Bruijn Graphs

Josef Rukavicka

A T-net of order $m$ is a graph with $m$ nodes and $2 m$ directed edges, where every node has indegree and outdegree equal to $2$ . (A well known example of T-nets are de Bruijn grap…

math.CO2017★ 8 cited

On Number of Rich Words

Josef Rukavicka

Any finite word $w$ of length $n$ contains at most $n + 1$ distinct palindromic factors. If the bound $n + 1$ is reached, the word $w$ is called rich. The number of rich words of lengt…