k-Colorability is Graph Automaton Recognizable
Formal Languages and Automata Theory
2023-02-01 v1 Discrete Mathematics
Abstract
Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes -colorable graphs.
Cite
@article{arxiv.1401.5287,
title = {k-Colorability is Graph Automaton Recognizable},
author = {Antonios Kalampakas},
journal= {arXiv preprint arXiv:1401.5287},
year = {2023}
}