Show simple item record

dc.contributor.authorBezrukov, Sergei
dc.contributor.authorFronček, Dalibor
dc.contributor.authorRosenberg, Steven J.
dc.contributor.authorKovář, Petr
dc.date.accessioned2008-02-22T12:56:08Z
dc.date.available2008-02-22T12:56:08Z
dc.date.issued2008
dc.identifier.citationDiscrete mathematics. 2008, vol. 308, issue 2-3, p. 319-323.en
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/10084/64877
dc.description.abstractIt was proved by Fronček, Jerebic, Klavžar, and Kovář that if a complete bipartite graph Kn,n with a perfect matching removed can be covered by k bicliques, then Click to view the MathML source. We give a slightly simplified proof and we show that the result is tight. Moreover, we use the result to prove analogous bounds for coverings of some other classes of graphs by bicliques.en
dc.format.extent110899 bytescs
dc.format.mimetypeapplication/pdfcs
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesDiscrete mathematicsen
dc.relation.urihttp://dx.doi.org/10.1016/j.disc.2006.11.045en
dc.subjectgraph coveringsen
dc.subjectbicliquesen
dc.subjectSperner's Theoremen
dc.subjectgraph compositionen
dc.subjectlexicographic producten
dc.titleOn biclique coveringsen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1016/j.disc.2006.11.045
dc.identifier.wos000252604400022


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record