EPT graphs on bounded degree trees
- Autores
- Alcón, Liliana Graciela; Gutiérrez, Marisa; Mazzoleni, María Pía
- Año de publicación
- 2014
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- An undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum degree h?
Facultad de Ciencias Exactas - Materia
-
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
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/101645
Ver los metadatos del registro completo
id |
SEDICI_de473e1ed096411258c02f801dd38974 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/101645 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
EPT graphs on bounded degree treesAlcón, Liliana GracielaGutiérrez, MarisaMazzoleni, María PíaMatemáticaIntersection graphsEPT graphsForbidden subgraphsAn undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum degree h?Facultad de Ciencias Exactas2014-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf1-8http://sedici.unlp.edu.ar/handle/10915/101645enginfo:eu-repo/semantics/altIdentifier/url/https://ri.conicet.gov.ar/11336/32783info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/docs/mc/pdf/42/a1.pdfinfo:eu-repo/semantics/altIdentifier/issn/0103-9059info:eu-repo/semantics/altIdentifier/hdl/11336/32783info: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-03T10:52:16Zoai:sedici.unlp.edu.ar:10915/101645Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:52:17.1SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
EPT graphs on bounded degree trees |
title |
EPT graphs on bounded degree trees |
spellingShingle |
EPT graphs on bounded degree trees Alcón, Liliana Graciela Matemática Intersection graphs EPT graphs Forbidden subgraphs |
title_short |
EPT graphs on bounded degree trees |
title_full |
EPT graphs on bounded degree trees |
title_fullStr |
EPT graphs on bounded degree trees |
title_full_unstemmed |
EPT graphs on bounded degree trees |
title_sort |
EPT graphs on bounded degree trees |
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 |
Matemática Intersection graphs EPT graphs Forbidden subgraphs |
topic |
Matemática Intersection graphs EPT graphs Forbidden subgraphs |
dc.description.none.fl_txt_mv |
An undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum degree h? Facultad de Ciencias Exactas |
description |
An undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum degree h? |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-04 |
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/101645 |
url |
http://sedici.unlp.edu.ar/handle/10915/101645 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://ri.conicet.gov.ar/11336/32783 info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/docs/mc/pdf/42/a1.pdf info:eu-repo/semantics/altIdentifier/issn/0103-9059 info:eu-repo/semantics/altIdentifier/hdl/11336/32783 |
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 1-8 |
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_ |
1842260404312473600 |
score |
13.13397 |