Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2020-08-27T19:10:24Z
dc.date.available 2020-08-27T19:10:24Z
dc.date.issued 2015
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/103276
dc.description.abstract An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. We call G a local EPT graph if it is the EPT graph of a collection of paths P which all share a common vertex. In this paper, we characterize the local EPT graphs which can be represented in a host tree with maximum degree h. en
dc.language en es
dc.title On local edge intersection graphs of paths on bounded degree trees en
dc.type Articulo es
sedici.identifier.uri https://pdfs.semanticscholar.org/8b49/964d5b8bc31fc3feda00f240595d2ff567fb.pdf es
sedici.creator.person Alcón, Liliana Graciela es
sedici.creator.person Gutiérrez, Marisa es
sedici.creator.person Mazzoleni, María Pía es
sedici.subject.materias Matemática es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Exactas es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.description.peerReview peer-review es
sedici.relation.journalTitle Matemática Contemporânea es
sedici.relation.journalVolumeAndIssue vol. 44 es


Download Files

Thumbnail
Documento completo
Download file (267.1Kb) - PDF
Icon
External link

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)