Maximal independent sets in graphs with at most one cycle
type: Item
instance of: scholarly article
title: Maximal independent sets in graphs with at most one cycle
zbMATH Open document ID: 0883.05076
DOI: 10.1016/S0166-218X(97)00033-4
author: Min-Jen Jou
author: Gerard Jennhwa Chang
published in: Discrete Applied Mathematics
publication date: 1998-02-23T00:00:00Z
full work available at URL: dam
review text: 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.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1088854
reviewed by: William G. Brown
MaRDI profile type: Publication
cites work: The number of maximal independent sets in connected graphs
cites work: The number of maximal independent sets in a connected graph
cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs
cites work: Maximal independent sets in bipartite graphs
cites work: On cliques in graphs
cites work: A Note on Independent Sets in Trees
cites work: The Number of Maximal Independent Sets in a Tree
description: scientific article; zbMATH DE number 1088854