Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
The proof of Theorem 2 of the original paper is corrected. The previous proof just covers the case \(m=O(n)\) where \(n\) is the number of vertices and \(m\) the number of edges of the graph whereas the full range \(m=O(n \ln n)\) must be covered.
scientific article; zbMATH DE number 5303731