Letter graphs and modular decomposition
Combinatorics
2021-11-17 v2
Abstract
We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call stacked paths.
Cite
@article{arxiv.2104.03055,
title = {Letter graphs and modular decomposition},
author = {Robert Ferguson and Vincent Vatter},
journal= {arXiv preprint arXiv:2104.03055},
year = {2021}
}