A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...