A walk u_0u_1 … u_k-1u_k of a graph G is a weakly toll
walk if u_0u_k ∉E...
A poset is a containment of paths in a tree (CPT) if it admits a
represe...
A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i
∈ E(G) implies ...
A graph is CIS if every maximal clique interesects every maximal stable ...