Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set S is a vertex separator for vertices a and b if the removal of S of the graph separates a and b intoâ€¦ (More)

The generalization of classical results about convex sets in Rn to abstract convexity spaces, defined by sets of paths in graphs, leads to many challenging structural and algorithmic problems. Hereâ€¦ (More)

A total coloring is equitable if the number of elements colored with each color differs by at most one, and the least integer for which a graph has such a coloring is called its equitable totalâ€¦ (More)