Maximal independent sets and regularity of graphs
From MaRDI portal
Publication:4958324
DOI10.1142/S0218196721500375zbMath1472.05122OpenAlexW3175076527MaRDI QIDQ4958324
Publication date: 7 September 2021
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196721500375
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Algebraic study on Cameron-Walker graphs
- Koszulness, Krull dimension, and other properties of graph-related algebras
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- The number of maximal independent sets in a connected graph
- The number of maximal independent sets in connected triangle-free graphs
- On the Castelnuovo-Mumford regularity and the arithmetic degree of monomial ideals
- Improved bounds for the regularity of edge ideals of graphs
- Regularity, matchings and Cameron-Walker graphs
- Characteristic-independence of Betti numbers of graph ideals
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- The graphs with maximum induced matching and maximum matching the same size
- Maximal independent sets in bipartite graphs
- The Number of Maximal Independent Sets in a Tree
- The number of maximal independent sets in connected graphs
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- Regularity of Squarefree Monomial Ideals
- Coverings, Matchings and the number of maximal independent sets of graphs
- On cliques in graphs
This page was built for publication: Maximal independent sets and regularity of graphs
