A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- Autores
- Alcón, Liliana Graciela; Gutierrez, 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 define 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 finite family of minimal forbidden subgraphs for the EPT class.
Fil: Alcón, Liliana Graciela. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: Gutierrez, Marisa. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina
Fil: Mazzoleni, María Pía. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina - Materia
-
INTERSECTION GRAPHS
EPT GRAPHS
FORBIDDEN SUBGRAPHS - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/241435
Ver los metadatos del registro completo
| id |
CONICETDig_ee44d91a3c65586e6ae2bcc1708ab6d5 |
|---|---|
| oai_identifier_str |
oai:ri.conicet.gov.ar:11336/241435 |
| network_acronym_str |
CONICETDig |
| repository_id_str |
3498 |
| network_name_str |
CONICET Digital (CONICET) |
| spelling |
A necessary condition for EPT graphs and a new family of minimal forbidden subgraphsAlcón, Liliana GracielaGutierrez, MarisaMazzoleni, María PíaINTERSECTION GRAPHSEPT GRAPHSFORBIDDEN SUBGRAPHShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1An 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 define 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 finite family of minimal forbidden subgraphs for the EPT class.Fil: Alcón, Liliana Graciela. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaFil: Gutierrez, Marisa. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaFil: Mazzoleni, María Pía. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaSociedad Brasilera de Matemática2010-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/241435Alcón, Liliana Graciela; Gutierrez, Marisa; Mazzoleni, María Pía; A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs; Sociedad Brasilera de Matemática; Matemática Contemporânea; 39; 13; 10-2010; 111-1200103-90592317-6636CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/volumes/volume-39/info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc3913info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-11-05T10:30:15Zoai:ri.conicet.gov.ar:11336/241435instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-11-05 10:30:15.44CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
| 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 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 Gutierrez, Marisa Mazzoleni, María Pía |
| author |
Alcón, Liliana Graciela |
| author_facet |
Alcón, Liliana Graciela Gutierrez, Marisa Mazzoleni, María Pía |
| author_role |
author |
| author2 |
Gutierrez, Marisa Mazzoleni, María Pía |
| author2_role |
author author |
| dc.subject.none.fl_str_mv |
INTERSECTION GRAPHS EPT GRAPHS FORBIDDEN SUBGRAPHS |
| topic |
INTERSECTION GRAPHS EPT GRAPHS FORBIDDEN SUBGRAPHS |
| purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| 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 define 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 finite family of minimal forbidden subgraphs for the EPT class. Fil: Alcón, Liliana Graciela. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina Fil: Gutierrez, Marisa. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina Fil: Mazzoleni, María Pía. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Departamento de Matemáticas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; Argentina |
| 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 define 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 finite family of minimal forbidden subgraphs for the EPT class. |
| publishDate |
2010 |
| dc.date.none.fl_str_mv |
2010-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion 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://hdl.handle.net/11336/241435 Alcón, Liliana Graciela; Gutierrez, Marisa; Mazzoleni, María Pía; A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs; Sociedad Brasilera de Matemática; Matemática Contemporânea; 39; 13; 10-2010; 111-120 0103-9059 2317-6636 CONICET Digital CONICET |
| url |
http://hdl.handle.net/11336/241435 |
| identifier_str_mv |
Alcón, Liliana Graciela; Gutierrez, Marisa; Mazzoleni, María Pía; A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs; Sociedad Brasilera de Matemática; Matemática Contemporânea; 39; 13; 10-2010; 111-120 0103-9059 2317-6636 CONICET Digital CONICET |
| 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/volumes/volume-39/ info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc3913 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
| dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf application/pdf application/pdf |
| dc.publisher.none.fl_str_mv |
Sociedad Brasilera de Matemática |
| publisher.none.fl_str_mv |
Sociedad Brasilera de Matemática |
| dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
| reponame_str |
CONICET Digital (CONICET) |
| collection |
CONICET Digital (CONICET) |
| instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
| repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
| repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
| _version_ |
1847977969988927488 |
| score |
13.087074 |