Towards settling the complexity of the lettericity problem

DOI10.1007/978-3-032-31348-5_20MaRDI QIDQ7411972zbMATH OpenFDO

Authors Nils Morawietz, Silas Cato Sacher

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-31348-5_20

zbMATH Keywords

letter graphslettericityneighborhood diversity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Bounds on the lettericity of graphs
• Generalized lettericity of graphs
• Graph thinness: a lower bound and complexity
• Implicit representations and factorial properties of graphs
• Letter graphs and geometric grid classes of permutations
• Letter graphs and modular decomposition
• Letter graphs and well-quasi-order by induced subgraphs
• Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
• On the Lettericity of Paths
• On the thinness and proper thinness of a graph
• Structural properties of word representable graphs

This page was built for publication: Towards settling the complexity of the lettericity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411972)