Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Noemí Gudiño"'
Publikováno v:
SEDICI (UNLP)
Universidad Nacional de La Plata
instacron:UNLP
Universidad Nacional de La Plata
instacron:UNLP
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
Publikováno v:
Discrete Applied Mathematics. 245:139-147
In this paper, motivated by the questions posed by Spinrad in Spinrad (2003) and Golumbic and Trenk (2004), we investigate those posets that admit a containment model mapping vertices into paths of a tree and their comparability graphs, named CPT pos
Publikováno v:
Electronic Notes in Discrete Mathematics. 50:175-180
The aim of the present work is the study of those posets that admit a containment model mapping vertices into paths of a tree, and their comparability graphs named CPT graphs. Answering a question posed by J.Spinrad, we prove that the dimension of CP
Publikováno v:
Discrete Applied Mathematics.
In this paper, motivated by the questions posed by Spinrad in Spinrad (2003) and Golumbic in Golumbic and Trenk (2004), we initiate the study of those posets that admit a containment model mapping vertices into paths of a tree and their comparability