Buscar
Mostrando ítems 11-20 de 56
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
(Elsevier Science, 2018-01)
Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a ...
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. ...
Clique coloring B1-EPG graphs
(Elsevier Science, 2017-05)
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...
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, ...
Clique-perfectness of complements of line graphs
(Elsevier Science, 2015-05)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and ...
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Instituto Politécnico Nacional, 2017)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Computación y Sistemas, 2017)