Preprint
Oct 2026
A forbidden-induced-subgraph characterization of beautiful graphs
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. Beautiful graphs were introduced as a hereditary class of Berge graphs, but a complete forbidden-induced-subgraph characterization was not obt...
Henning Wunderlich
· 0 citations