Upload resources

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

 

Show simple item record

dc.date.accessioned 2020-08-07T14:58:32Z
dc.date.available 2020-08-07T14:58:32Z
dc.date.issued 2014-04
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/101645
dc.description.abstract 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? en
dc.format.extent 1-8 es
dc.language en es
dc.subject Intersection graphs es
dc.subject EPT graphs es
dc.subject Forbidden subgraphs es
dc.title EPT graphs on bounded degree trees en
dc.type Articulo es
sedici.identifier.uri https://ri.conicet.gov.ar/11336/32783 es
sedici.identifier.uri http://mc.sbm.org.br/docs/mc/pdf/42/a1.pdf es
sedici.identifier.other hdl:11336/32783 es
sedici.identifier.issn 0103-9059 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. 42 es


Download Files

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)