Skip to Main content Skip to Navigation
Journal articles

On probe 2-clique graphs and probe diamond-free graphs

Abstract : 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 non-edges of G, whose endpoints are nonprobe vertices, can be added so that the resulting graph belongs to G. We investigate probe 2-clique graphs and probe diamond-free graphs. For probe 2-clique graphs, we present a polynomial-time recognition algorithm. Probe diamond-free graphs are characterized by minimal forbidden induced subgraphs. As a by-product, it is proved that the class of probe block graphs is the intersection between the classes of chordal graphs and probe diamond-free graphs.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, September 10, 2015 - 3:17:31 PM
Last modification on : Tuesday, October 19, 2021 - 11:03:56 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 12:03:23 AM


Publisher files allowed on an open archive




Flavia Bonomo, Celina M. H. De Figueiredo, Guillermo Duran, Luciano N. Grippo, Martín D. Safe, et al.. On probe 2-clique graphs and probe diamond-free graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no. 1 (1), pp.187--199. ⟨10.46298/dmtcs.2122⟩. ⟨hal-01196866⟩



Record views


Files downloads