A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs

Autores
Alcón, Liliana Graciela; Gutiérrez, Marisa; Mazzoleni, María Pía
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Facultad de Ciencias Exactas
Departamento de Matemática
Materia
Ciencias Exactas
Matemática
intersection graphs
EPT graphs
forbidden subgraphs
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/164530
Acceder
id SEDICI_9a2a03309a117ddf7fd77044348b7082
oai_identifier_str oai:sedici.unlp.edu.ar:10915/164530
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A necessary condition for EPT graphs and a new family of minimal forbidden subgraphsAlcón, Liliana GracielaGutiérrez, MarisaMazzoleni, María PíaCiencias ExactasMatemáticaintersection graphsEPT graphsforbidden subgraphsAn 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.Facultad de Ciencias ExactasDepartamento de Matemática2010info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf111-120http://sedici.unlp.edu.ar/handle/10915/164530enginfo:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/39-13.pdfinfo:eu-repo/semantics/altIdentifier/issn/2317-6636info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:14:37Zoai:sedici.unlp.edu.ar:10915/164530Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:14:37.616SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
title A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
spellingShingle A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
Alcón, Liliana Graciela
Ciencias Exactas
Matemática
intersection graphs
EPT graphs
forbidden subgraphs
title_short A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
title_full A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
title_fullStr A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
title_full_unstemmed A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
title_sort A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
Gutiérrez, Marisa
Mazzoleni, María Pía
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Gutiérrez, Marisa
Mazzoleni, María Pía
author_role author
author2 Gutiérrez, Marisa
Mazzoleni, María Pía
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Exactas
Matemática
intersection graphs
EPT graphs
forbidden subgraphs
topic Ciencias Exactas
Matemática
intersection graphs
EPT graphs
forbidden subgraphs
dc.description.none.fl_txt_mv 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.
Facultad de Ciencias Exactas
Departamento de Matemática
description 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.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/164530
url http://sedici.unlp.edu.ar/handle/10915/164530
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/39-13.pdf
info:eu-repo/semantics/altIdentifier/issn/2317-6636
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
111-120
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260651071766528
score 13.13397

Publicaciones similares