Buscar
Mostrando ítems 1-10 de 56
Recognizing clique graphs of directed edge path graphs
(Elsevier Science BvAmsterdamHolanda, 2003)
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
(Elsevier B.V., 2018)
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 ...
Clique coloring B1-EPG graphs
(Elsevier, 2017)
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 ...
Clique-perfectness of complements of line graphs
(Elsevier, 2015)
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 ...
Edge clique graphs and some classes of chordal graphs
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
p-BOX: A new graph model
(2015)
In this document, we study the scope of the following graph model: each vertex is assigned to a box in Rd and to a
representative element that belongs to that box. Two vertices are connected by an edge if and only if its ...