Pages that link to "Item:Q4695389"

The following pages link to The Number of Maximal Independent Sets in Triangle-Free Graphs (Q4695389):

Displaying 12 items.

• Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
• An upper bound on the number of cliques in a graph (Q5287454) (← links)
• On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
• Coverings, Matchings and the number of maximal independent sets of graphs (Q5377038) (← links)
• Maximal induced matchings in triangle-free graphs (Q5891021) (← links)
• On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza (Q6094038) (← links)
• Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
• Enumerating maximal dissociation sets in three classes of grid graphs (Q6585552) (← links)
• The maximum number of maximum generalized 4-independent sets in trees (Q6606325) (← links)
• Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs (Q6633556) (← links)
• On the number of \(k\)-dominating independent sets in planar graphs (Q6648346) (← links)
• The minimum number of maximal independent sets in twin-free graphs (Q6671603) (← links)