Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.creatorBonomo, Flavia-
dc.creatorGrippo, Luciano Norberto-
dc.creatorMilanič, Martin-
dc.creatorSafe, Martin Dario-
dc.date2018-08-15T04:08:01Z-
dc.date2018-08-15T04:08:01Z-
dc.date2016-01-
dc.date2018-08-14T14:00:01Z-
dc.date.accessioned2019-04-29T15:27:18Z-
dc.date.available2019-04-29T15:27:18Z-
dc.date.issued2018-08-15T04:08:01Z-
dc.date.issued2018-08-15T04:08:01Z-
dc.date.issued2016-01-
dc.date.issued2018-08-14T14:00:01Z-
dc.identifierBonomo, Flavia; Grippo, Luciano Norberto; Milanič, Martin; Safe, Martin Dario; Graph classes with and without powers of bounded clique-width; Elsevier Science; Discrete Applied Mathematics; 199; 1-2016; 3-15-
dc.identifier0166-218X-
dc.identifierhttp://hdl.handle.net/11336/55546-
dc.identifierCONICET Digital-
dc.identifierCONICET-
dc.identifier.urihttp://rodna.bn.gov.ar:8080/jspui/handle/bnmm/294460-
dc.descriptionWe initiate the study of graph classes of power-bounded clique-width, that is, graph classes for which there exist integers k and ℓ such that the kth powers of the graphs are of clique-width at most ℓ. We give sufficient and necessary conditions for this property. As our main results, we characterize graph classes of power-bounded clique-width within classes defined by either one forbidden induced subgraph, or by two connected forbidden induced subgraphs. We also show that for every positive integer k, there exists a graph class such that the kth powers of graphs in the class form a class of bounded clique-width, while this is not the case for any smaller power.-
dc.descriptionFil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas ; Argentina-
dc.descriptionFil: Grippo, Luciano Norberto. Universidad Nacional de General Sarmiento; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina-
dc.descriptionFil: Milanič, Martin. University Of Primorska; Eslovenia-
dc.descriptionFil: Safe, Martin Dario. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de General Sarmiento; Argentina-
dc.formatapplication/pdf-
dc.formatapplication/pdf-
dc.formatapplication/pdf-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherElsevier Science-
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2015.06.010-
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0166218X15002966-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/-
dc.sourcereponame:CONICET Digital (CONICET)-
dc.sourceinstname:Consejo Nacional de Investigaciones Científicas y Técnicas-
dc.sourceinstacron:CONICET-
dc.subjectCLIQUE-WIDTH-
dc.subjectHEREDITARY GRAPH CLASS-
dc.subjectPOWER OF A GRAPH-
dc.subjectPOWER-BOUNDED CLIQUE-WIDTH-
dc.subjectCiencias de la Computación-
dc.subjectCiencias de la Computación e Información-
dc.subjectCIENCIAS NATURALES Y EXACTAS-
dc.subjectMatemática Pura-
dc.subjectMatemáticas-
dc.subjectCIENCIAS NATURALES Y EXACTAS-
dc.titleGraph classes with and without powers of bounded clique-width-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/publishedVersion-
dc.typeinfo:ar-repo/semantics/articulo-
Aparece en las colecciones: CONICET

Ficheros en este ítem:
No hay ficheros asociados a este ítem.