dc.creatorGutiérrez, Marisa
dc.date2001
dc.date2022-04-11T18:36:12Z
dc.date.accessioned2023-07-15T04:42:02Z
dc.date.available2023-07-15T04:42:02Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/134311
dc.identifierissn:0911-0119
dc.identifierissn:1435-5914
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7470551
dc.descriptionLet P be a class of finite families of finite sets that satisfy a property P. We call ΩP the class of intersection graphs of families in P and CliqueP the class of graphs whose family of cliques is in P. We prove that a graph G is in ΩP if and only if there is a family of complete sets of G which covers all edges of G and whose dual family is in P. This result generalizes that of Gavril for circular-arc graphs and conduces those of Fulkerson-Gross, Gavril and Monma-Wei for interval graphs, chordal graphs, UV, DV and RDV graphs. Moreover, it leads to the characterization of Helly-graphs and dually chordal graphs as classes of intersection graphs. We prove that if P is closed under reductions, then CliqueP=Ω(P*∩H) (P*= Class of dual families of families in P). We find sufficient conditions for the Clique Operator, K, to map ΩP into ΩP*. These results generalize several known results for particular classes of intersection graphs. Furthermore, they lead to the Roberts-Spencer characterization for the image of K and the Bandelt-Prisner result on K-fixed classes.
dc.descriptionFacultad de Ciencias Exactas
dc.formatapplication/pdf
dc.format237-244
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectMatemática
dc.subjectIntersection Graph
dc.subjectInterval Graph
dc.subjectChordal Graph
dc.subjectFinite Family
dc.subjectDual Family
dc.titleIntersection Graphs and the Clique Operator
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución