Browsing by Subject "2-clique graphs"

Now showing items 1-1 of 1

    • On probe 2-clique graphs and probe diamond-free graphs 
      Bonomo, Flavia; Figueiredo, Celina de; Durán Maggiolo, Guillermo; Grippo, Luciano; Safe, Martín; Szwarcfiter, Jayme (Discrete Mathematics and Theoretical Computer Science, 2015)
      Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices and a stable set of nonprobe vertices in such a way that ...