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

Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are well-quasi-ordered by induced subgraphs. The latter property implies that any hereditary class of graphs of bounded lette...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica
Main Authors:	Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor
Format:	Journal Article
Language:	English
Published:	Springer Verlag 19.02.2024
Subjects:	Computational Complexity Computer Science Data Structures and Algorithms Discrete Mathematics Discrete Mathematics (cs.DM) FOS: Computer and information sciences FOS: Mathematics Data Structures and Algorithms (cs.DS) Combinatorics (math.CO)
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!