2 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Henning Wunderlich
A graph is beautiful if each of its induced subgraphs is the intersection graph of all maximal nonempty 1-rectangles of a binary matrix, with adjacency defined by a common cell. Be…