Title of article
On cover-structure graphs Original Research Article
Author/Authors
Henning Wunderlich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
3289
To page
3299
Abstract
Motivated by a problem in communication complexity, we study cover-structure graphs (cs-graphs), defined as intersection graphs of maximal monochromatic rectangles in a matrix. We show that not every graph is a cs-graph. Especially, squares and odd holes are not cs-graphs.
Keywords
Berge graphs , Beautiful graphs , Perfect graphs , Information theory , Communication complexity , Rectangle covers
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887263
Link To Document