# Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders

## TL;DR

This paper introduces a novel perspective on de Bruijn graphs and their subgraphs by utilizing circular words instead of linear sequences, offering new insights into their structure.

## Contribution

It presents a new approach to analyzing de Bruijn graphs through circular words, expanding the understanding of their properties and related graph classes.

## Key findings

- New framework for de Bruijn graphs using circular words
- Connections between circular words and graph structures like Kautz and Rauzy graphs
- Potential applications in combinatorics and graph theory

## Abstract

We suggest a new point of view on de Bruijn graphs and their subgraphs based on using circular words rather than linear ones.