On probe 2-clique graphs and probe diamond-free graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

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.
Fichier principal
Vignette du fichier
dmtcs-17-1-13.pdf (281.29 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01196866 , version 1 (10-09-2015)

Identifiers

Cite

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, 2015, Vol. 17 no. 1 (1), pp.187--199. ⟨10.46298/dmtcs.2122⟩. ⟨hal-01196866⟩

Collections

TDS-MACS
60 View
839 Download

Altmetric

Share

Gmail Facebook X LinkedIn More