ARTIKELDIGITAL.COM

trapezoid ⊂ cocomparability ⊂ AT-free. The class of cocomparability graphs is self-complementary in the sense that the complement of a cocomparability graph...

graphs are AT-free. Cocomparability graphs are AT-free. The class hierarchy is: interval ⊂ permutation ⊂ trapezoid ⊂ cocomparability ⊂ AT-free {\displaystyle...

(2012), "A simple polynomial algorithm for the longest path problem on cocomparability graphs", SIAM Journal on Discrete Mathematics, 26 (3): 940–963, arXiv:1004...

Zbl 0780.90104 Kratsch, Dieter; Stewart, Lorna (1993), "Domination on cocomparability graphs", SIAM Journal on Discrete Mathematics, 6 (3): 400–417, doi:10...

of the family of the complements of comparability graphs known as cocomparability graphs. A unit disk graph is defined as the intersection graph of unit...

permutation, trapezoid, circular-arc, circular permutation graphs, and cocomparability graphs of bounded dimension. For undirected trees, tree-depth can be...

The complement graph of every comparability graph (also known as the cocomparability graph) is also a string graph. Kratochvíl (1991b) showed string graph...

1016/0166-218X(93)90012-D. Habib, Michel; Möhring, Rolf H. (1994), "Treewidth of cocomparability graphs and a new order-theoretic parameter", Order, 11 (1): 47–60,...

linear time for trees and in polynomial time for chordal graphs and cocomparability graphs. A graph G {\displaystyle G} is called a domination-perfect...