Characterization and linear-time recognition of balanced distance-hereditary graphs

Lucía Busolini, Guillermo Durán, Martín D. Safe

A graph is balanced if its clique-matrix contains no square submatrix of odd order with exactly two $1$'s in each row and in each column. Although it is known that a graph is balan…