On the maximum number of maximum independent sets of bipartite graphs
From MaRDI portal
Publication:6566705
DOI10.1007/S00009-024-02671-8zbMATH Open1541.05134MaRDI QIDQ6566705
Publication date: 3 July 2024
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal independent sets in minimum colorings
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Maximal independent sets in caterpillar graphs
- On graphs with the third largest number of maximal independent sets
- Graphs with the second largest number of maximal independent sets
- Fibonacci index and stability number of graphs: a polyhedral study
- Trees with the second largest number of maximal independent sets
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- On the maximum number of maximum independent sets
- Trees with given stability number and minimum number of stable sets
- Eine Extremalaufgabe aus der Graphentheorie.
- Maximal independent sets in bipartite graphs
- Maximal independent sets in graphs with at mostr cycles
- Maximal and maximum independent sets in graphs with at mostr cycles
- The structure and maximum number of maximum independent sets in trees
- On cliques in graphs
- The number of maximum independent sets in graphs
- On the maximum number of maximum independent sets in connected graphs
This page was built for publication: On the maximum number of maximum independent sets of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566705)
