Buscar
Mostrando ítems 1-10 de 14
Strong cliques and equistability of EPT graphs
(Elsevier Science, 2016-04)
In this paper, we characterize the equistable graphs within the class of EPT graphs, the edge-intersection graphs of paths in a tree. This result generalizes a previously known characterization of equistable line graphs. ...
EPT graphs on bounded degree trees
(Sociedade Brasileira de Matematica, 2014-04)
An undirected graphGis called anEPT graphif it is the edgeintersection graph of a family of paths in a tree. In this paper, weanswer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced ...
Helly EPT graphs on bounded degree trees: Characterization and recognition
(Elsevier Science, 2017-12)
The edge-intersection graph of a family of paths on a host tree is called an EPT graph. When the tree has maximum degree h, we say that the graph is [h,2,2]. If, in addition, the family of paths satisfies the Helly property, ...
On the helly property of some intersection graphs
(Universidade Federal do Rio de JaneiroBrasilPrograma de Pós-Graduação em Filosofia em Engenharia de Sistemas e ComputaçãoRio de Janeiro, 2022)
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
(Elsevier Science, 2015-01)
An undirected graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admit a VPT representation in a host tree with maximum degree at most h is denoted ...