Strong cliques and equistability of EPT graphs ?
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. Our approach is based on the combinatorial features of triangle graphs and general partition graphs. We also show that, in EPT graphs, testing whether a given clique is strong is co-NP-complete. We obtain this hardness result by first showing hardness of the problem of determining whether a given graph has a maximal matching disjoint from a given edge cut. As a positive result, we prove that the problem of testing whether a given clique is strong is polynomial in the class of local EPT graphs, which are defined as the edge intersection graphs of paths in a star and are known to coincide with the line graphs of multigraphs.
strong clique ept graph equistable graph triangle graph general partition graph triangle condition