Show simple item record

dc.creatorBonomo F.
dc.creatorSchaudt O.
dc.creatorStein M.
dc.creatorValencia-Pabon, M
dc.date.accessioned2016-12-12T21:21:57Z
dc.date.available2016-12-12T21:21:57Z
dc.date.issued2015
dc.identifier.issn0178-4617
dc.identifier.urihttp://hdl.handle.net/10533/147921
dc.language.isoeng
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.titleb-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
dc.typeArticulo
dc.bibliographicCitation.stpage289
dc.bibliographicCitation.endpage305
dc.identifier.folioPFB03
dc.description.conicytprogramPrograma de Investigación Asociativa (PIA)
dc.description.poscdisciplinaComputer Science, Software Engineering
dc.description.quartilisiQ3
dc.description.volume73
dc.relation.projectidinfo:eu-repo/grantAgreement/PIA/PFB03
dc.rights.driverinfo:eu-repo/semantics/openAccess
dc.title.journalAlgorithmica
dc.type.driverinfo:eu-repo/semantics/article
dc.description.shortconicytprogramPrograma de Investigación Asociativa (PIA)
dc.description.jcr2015
dc.type.openaireinfo:eu-repo/semantics/publishedVersion


Files in this item

FilesSizeFormatView

There are no files associated with this item

This item appears in the following Collection(s)

Show simple item record