On the number of maximal independent sets in a graph
From MaRDI portal
(Redirected from Publication:5403002)
Recommendations
Cited in
(31)- A simple proof that finding a maximal independent set in a graph is in NC
- Maximal independent sets in grid graphs
- Maximal independent sets and regularity of graphs
- scientific article; zbMATH DE number 1465674 (Why is no real title available?)
- Maximal independent sets and separating covers
- Determining the \(L(2,1)\)-span in polynomial space
- An extension of the Win theorem: counting the number of maximum independent sets
- On the third largest number of maximal independent sets of graphs
- scientific article; zbMATH DE number 7316311 (Why is no real title available?)
- Enumerating maximal independent sets with applications to graph colouring.
- On the number of maximum independent sets of graphs
- MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS
- Maximum independent sets in 3- and 4-regular Hamiltonian graphs
- Maximal and maximum independent sets in graphs with at mostr cycles
- Maximal independent sets in clique-free graphs
- The number of maximal independent sets in connected graphs
- On the Independence Number of Graphs with Maximum Degree 3
- On the number of \(k\)-dominating independent sets in planar graphs
- On the maximal independence polynomial of certain graph configurations
- scientific article; zbMATH DE number 5842466 (Why is no real title available?)
- scientific article; zbMATH DE number 3859176 (Why is no real title available?)
- Counting Maximal Independent Sets in Subcubic Graphs
- On the number of independent sets in graphs with fixed independence number
- The minimum number of maximal independent sets in twin-free graphs
- On the number of independent sets in damaged Cayley graphs
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs
- On the maximum number of maximum independent sets
- scientific article; zbMATH DE number 5995277 (Why is no real title available?)
- On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7
This page was built for publication: On the number of maximal independent sets in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403002)