Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2024-04-08T13:09:01Z
dc.date.available 2024-04-08T13:09:01Z
dc.date.issued 2010
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/164530
dc.description.abstract An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. In this paper we de ne the concept of satellite of a clique and we give a necessary condition to be an EPT graph based on satellites of cliques. We characterize the minimal graphs which do not satisfy the previous condition, as a consequence we present a nite family of minimal forbidden subgraphs for the EPT class. en
dc.format.extent 111-120 es
dc.language en es
dc.subject intersection graphs es
dc.subject EPT graphs es
dc.subject forbidden subgraphs es
dc.title A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs en
dc.type Articulo es
sedici.identifier.uri https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/39-13.pdf es
sedici.identifier.issn 2317-6636 es
sedici.creator.person Alcón, Liliana Graciela es
sedici.creator.person Gutiérrez, Marisa es
sedici.creator.person Mazzoleni, María Pía es
sedici.subject.materias Ciencias Exactas es
sedici.subject.materias Matemática es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Exactas es
mods.originInfo.place Departamento de Matemática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.relation.event IV Latin-American Workshop on Cliques in Graphs (Itaipava, Río de Janeiro, Brasil, 16 al 19 de noviembre de 2010) es
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Matemática Contemporânea es
sedici.relation.journalVolumeAndIssue vol. 39 es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)