Maximal independent sets in graphs with at mostr cycles

DOI10.1002/jgt.20185zbMath1107.05044arXivmath/0207100OpenAlexW2951938968MaRDI QIDQ3418194

C. Y. Goh, Bruce E. Sagan, Khee Meng Koh, Vincent R. Vatter

Publication date: 2 February 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0207100

zbMATH Keywords

cycle ear decomposition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

The number of maximal independent sets in trees with a given number of leaves ⋮ Maximal independent sets on a grid graph ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ The maximum number of maximal independent sets in unicyclic connected graphs ⋮ On graphs with the third largest number of maximal independent sets ⋮ Coverings, Matchings and the number of maximal independent sets of graphs ⋮ On the maximum number of cliques in a graph ⋮ Graphs with the second largest number of maximal independent sets ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Maximal independent sets in caterpillar graphs

This page was built for publication: Maximal independent sets in graphs with at mostr cycles