Maximal independent sets in graphs with at most one cycle
Following the work of \textit{J. W. Moon} and \textit{L. Moser} [On cliques in graphs, Isr. J. Math. 3, 23-28 (1965; Zbl 0144.23205)], which determined the maximum number of cliques (and hence of independent complete sets of vertices) in graphs on \(n\) vertices, numerous authors have investigated this problem for variously restricted classes of graphs. The present authors are concerned with graphs having at most one cycle.
scientific article; zbMATH DE number 1088854