A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
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...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Argentina |
| Recursos: | Universidad Nacional de La Plata |
| Repositorio: | SEDICI (UNLP) |
| Idioma: | inglés |
| OAI Identifier: | oai:sedici.unlp.edu.ar:10915/164530 |
| Acesso em linha: | http://sedici.unlp.edu.ar/handle/10915/164530 |
| Access Level: | acceso abierto |
| Palavra-chave: | Ciencias Exactas Matemática intersection graphs EPT graphs forbidden subgraphs |
| Resumo: | 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. |
|---|