arXiv Open Access 2014

k-Colorability is Graph Automaton Recognizable

Antonios Kalampakas

Lihat Sumber

Abstrak

Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes $k$-colorable graphs.

Topik & Kata Kunci

cs.FL cs.DM

Penulis (1)

Antonios Kalampakas

Format Sitasi

APA MLA BibTeX

Kalampakas, A. (2014). k-Colorability is Graph Automaton Recognizable. https://arxiv.org/abs/1401.5287

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓