EPT graphs on bounded degree trees

dc.creatorAlcón, Liliana Graciela
dc.creatorGutierrez, Marisa
dc.creatorMazzoleni, María Pía
dc.date.accessioned2018-01-10T14:13:59Z
dc.date.accessioned2018-11-06T14:06:56Z
dc.date.available2018-01-10T14:13:59Z
dc.date.available2018-11-06T14:06:56Z
dc.date.created2018-01-10T14:13:59Z
dc.date.issued2014-04
dc.identifierAlcón, Liliana Graciela; Gutierrez, Marisa; Mazzoleni, María Pía; EPT graphs on bounded degree trees; Sociedade Brasileira de Matematica; MATEMáTICA CONTEMPORâNEA; 42; 4-2014; 1-8
dc.identifier0103-9059
dc.identifierhttp://hdl.handle.net/11336/32783
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1883051
dc.description.abstractAn undirected graphGis called anEPT graphif it is the edgeintersection graph of a family of paths in a tree. In this paper, weanswer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater thanhberepresented in a host tree with maximum degreeh?
dc.languageeng
dc.publisherSociedade Brasileira de Matematica
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/volumes/volume-42/
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/docs/mc/pdf/42/a1.pdf
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectINTERSECTION GRAPHS
dc.subjectEPT GRAPHS
dc.subjectFORBIDDEN SUBGRAPHS
dc.titleEPT graphs on bounded degree trees
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución