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

dc.creatorBonomo, Flavia
dc.creatorFigueiredo, Celina M. H. de
dc.creatorDuran, Guillermo Alfredo
dc.creatorGrippo, Luciano Norberto
dc.creatorSafe, Martin Dario
dc.creatorSzwarcfiter, Jayme L.
dc.date.accessioned2017-07-25T21:40:52Z
dc.date.available2017-07-25T21:40:52Z
dc.date.created2017-07-25T21:40:52Z
dc.date.issued2015-03
dc.identifierBonomo, Flavia; Figueiredo, Celina M. H. de; Duran, Guillermo Alfredo; Grippo, Luciano Norberto; Safe, Martin Dario; et al.; On probe 2-clique graphs and probe diamond-free graphs; Chapman & Hall; Discrete Mathematics and Theoretical Computer Science; 17; 1; 3-2015; 187-200
dc.identifier1365-8050
dc.identifierhttp://hdl.handle.net/11336/21313
dc.identifierCONICET Digital
dc.identifierCONICET
dc.description.abstractGiven 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.
dc.languageeng
dc.publisherChapman & Hall
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/download/2546/4672.pdf
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subject2-Clique Graphs
dc.subjectDiamond-Free Graphs
dc.subjectProbe Graphs
dc.titleOn probe 2-clique graphs and probe diamond-free graphs
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución