Maximal independent sets in caterpillar graphs (Q765369): Difference between revisions

@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in connected triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in connected graphs
+Normal rank
@@ Property / cites work @@
+Maximal independent sets in graphs with at mostr cycles
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in a connected graph
+Normal rank
@@ Property / cites work @@
+Q5668506
@@ Property / cites work: Q5668506 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm to generate all maximal independent sets on trapezoid graphs
+Normal rank
@@ Property / cites work @@
+The Number of Maximal Independent Sets in Triangle-Free Graphs
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal independent sets in graphs with at most one cycle
+Normal rank
@@ Property / cites work @@
+A finiteness theorem for maximal independent sets
@@ Property / cites work: A finiteness theorem for maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of maximal independent sets in unicyclic connected graphs
+Normal rank
@@ Property / cites work @@
+Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
+Normal rank
@@ Property / cites work @@
+Maximal independent sets in bipartite graphs
@@ Property / cites work: Maximal independent sets in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-thickness and caterpillar-thickness under girth constraints
+Normal rank
@@ Property / cites work @@
+A new backtracking algorithm for generating the family of maximal independent sets of a graph
+Normal rank
@@ Property / cites work @@
+A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting the number of independent sets in chordal graphs
+Normal rank
@@ Property / cites work @@
+The number of independent sets in unicyclic graphs
+Normal rank
@@ Property / cites work @@
+A Note on Independent Sets in Trees
@@ Property / cites work: A Note on Independent Sets in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal and maximum independent sets in graphs with at mostr cycles
+Normal rank
@@ Property / cites work @@
+Q4407448
@@ Property / cites work: Q4407448 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Maximal Independent Sets in a Tree
@@ Property / cites work: The Number of Maximal Independent Sets in a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Trees with extremal numbers of maximal independent sets including the set of leaves
+Normal rank
@@ Property / cites work @@
+Generate all maximal independent sets in permutation graphs
+Normal rank