A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
From MaRDI portal
Publication:1322267
DOI10.1016/0012-365X(94)90156-2zbMath0796.05079MaRDI QIDQ1322267
Carol A. Whitehead, Bert L. Hartnell, Arthur S. Finbow
Publication date: 9 June 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
On graphs having maximal independent sets of exactly \(t\) distinct cardinalities, \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs, On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7, Well-indumatched Trees and Graphs of Bounded Girth, Mind the independence gap
Cites Work