On k-tree Containment Graphs of Paths in a Tree

A k -tree is either a complete graph on k vertices or a graph that contains a vertex whose neighborhood induces a complete graph on k vertices and whose removal results in a k -tree. If the comparability graph of a poset P is a k -tree, we say that P is a k -tree poset. In the present work, we study...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Order (Dordrecht) 2021-07, Vol.38 (2), p.229-244
Hauptverfasser:	Alcón, Liliana, Gudiño, Noemí, Gutierrez, Marisa
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Apexes Completeness Containment Discrete Mathematics Graph theory Graphs Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures Set theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!