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...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica
Hlavní autoři:	Alecu, Bogdan, Kanté, Mamadou Moustapha, Lozin, Vadim, Zamaraev, Viktor
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Springer Verlag 19.02.2024
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!