Document is current

Any future updates will be listed below

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

Crossref DOI link: https://doi.org/10.1007/s00453-025-01341-9

Published Online: 2025-11-10

Published Print: 2026-02

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark