Bipartite graphs without a skew star
Discrete Mathematics
On the Clique-Width of Graphs in Hereditary Classes
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Boundary properties of graphs for algorithmic graph problems
Theoretical Computer Science
Locally bounded coverings and factorial properties of graphs
European Journal of Combinatorics
| Hi-index | 0.00 |
This paper studies a new method for representing $\Gamma$-free matrices, which occur in characterizations of chordal bipartite and strongly chordal graphs. We show that the number of $\Gamma$-free matrices with $n$ rows and columns (and thus the number of chordal bipartite and strongly chordal graphs with $n$ vertices) is proportional to $2^\Theta(n \log^{2} n)$, and give an asymptotically space optimal method for storing these matrices.