Artículo
A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
Fecha de publicación:
10/2010
Editorial:
Sociedad Brasilera de Matemática
Revista:
Matemática Contemporânea
ISSN:
0103-9059
e-ISSN:
2317-6636
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
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.
Palabras clave:
INTERSECTION GRAPHS
,
EPT GRAPHS
,
FORBIDDEN SUBGRAPHS
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(CCT - LA PLATA)
Articulos de CTRO.CIENTIFICO TECNOL.CONICET - LA PLATA
Articulos de CTRO.CIENTIFICO TECNOL.CONICET - LA PLATA
Citación
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
Compartir
Altmétricas