On clique-perfect and k-perfect graphs

dc.date.accessioned2017-03-23T17:45:26Z
dc.date.available2017-03-23T17:45:26Z
dc.date.created2017-03-23T17:45:26Z
dc.date.issued2006
dc.identifier0381-7032
dc.identifierhttp://hdl.handle.net/10533/177519
dc.identifier1050747
dc.identifierWOS:000239360600010
dc.languageeng
dc.publisherDEPT. OF COMBINATORICS AND OPTIMIZATION, UNIVERSITY OF WATERLOO
dc.relationinfo:eu-repo/grantAgreement/Fondecyt/1050747
dc.relationinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93477
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleOn clique-perfect and k-perfect graphs
dc.typeArticulo


Este ítem pertenece a la siguiente institución