Maximal independent sets in bipartite graphs
From MaRDI portal
Publication:3137766
DOI10.1002/jgt.3190170407zbMath0783.05063OpenAlexW1966320878MaRDI QIDQ3137766
Publication date: 13 October 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170407
Related Items (21)
Maximal and maximum dissociation sets in general and triangle-free graphs ⋮ On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets ⋮ Maximal independent sets in graphs with at most one cycle ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ Trees with maximum number of maximal matchings ⋮ On radius 2 trees with the maximum number of matchings ⋮ Maximum dissociation sets in subcubic trees ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ On the maximum number of maximum dissociation sets in trees with given dissociation number ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Independent sets in graphs ⋮ Coverings, Matchings and the number of maximal independent sets of graphs ⋮ Trees with a given number of leaves and the maximal number of maximum independent sets ⋮ Graphs with the second largest number of maximal independent sets ⋮ Maximal independent sets and regularity of graphs ⋮ Trees without twin-leaves with smallest number of maximal independent sets ⋮ Facets for node packing ⋮ Maximal independent sets in caterpillar graphs ⋮ Fixed points and maximal independent sets in AND-OR networks ⋮ A finiteness theorem for maximal independent sets ⋮ The number of maximal independent sets in connected triangle-free graphs
Cites Work
This page was built for publication: Maximal independent sets in bipartite graphs
