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 ak-tree …
neighborhood induces a complete graph on k vertices and whose removal results in ak-tree …
Containment orders–a lifelong journey
MC Golumbic - AKCE International Journal of Graphs and …, 2024 - Taylor & Francis
Mathematical explorations steer us through fields and forests of applications where science
and computing meet discrete structures and combinatorics. Today's excursion takes us on …
and computing meet discrete structures and combinatorics. Today's excursion takes us on …
Containment graphs and posets of paths in a tree: wheels and partial wheels
MC Golumbic, V Limouzy - Order, 2021 - Springer
We consider questions regarding the containment graphs of paths in a tree (CPT graphs), a
subclass of comparability graphs, and the containment posets of paths in a tree (CPT …
subclass of comparability graphs, and the containment posets of paths in a tree (CPT …
Dimension of CPT posets
A collection of linear orders on X, say LL, is said to realize a partially ordered set (or poset)
P=(X,≼) P=(X,⪯) if, for any two distinct x, y∈ X, x≼ y if and only if x≺ L y,∀ L∈ L ∀L∈L. We …
P=(X,≼) P=(X,⪯) if, for any two distinct x, y∈ X, x≼ y if and only if x≺ L y,∀ L∈ L ∀L∈L. We …
On Dually-CPT and Strongly-CPT Posets
A poset is a containment of paths in a tree (CPT) if it admits a representation by containment
where each element of the poset is represented by a path in a tree and two elements are …
where each element of the poset is represented by a path in a tree and two elements are …
On dually-CPT and strong-CPT posets
A poset is a containment of paths in a tree (CPT) if it admits a representation by containment
where each element of the poset is represented by a path in a tree and two elements are …
where each element of the poset is represented by a path in a tree and two elements are …