Letter graphs and modular decomposition

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.

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2022-03, Vol.309, p.215-220
Hauptverfasser:	Ferguson, Robert, Vatter, Vincent
Format:	Artikel
Sprache:	eng
Schlagworte:	Graphs Lettericity Modular decomposition Prime graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!