Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2402.12559