Letter graphs and modular decomposition

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.

Gespeichert in:
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!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2021.11.007