Some bounds on the size of maximum G-free sets in graphs (Q6174763): Difference between revisions

@@ Property / cites work @@
+The complexity of \(G\)-free colourability
@@ Property / cites work: The complexity of \(G\)-free colourability / rank @@
+Normal rank
@@ Property / cites work @@
+Large induced forests in sparse graphs
@@ Property / cites work: Large induced forests in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decycling numbers of random regular graphs
@@ Property / cites work: Decycling numbers of random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decycling graphs
@@ Property / cites work: Decycling graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3220612
@@ Property / cites work: Q3220612 / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the independence number of a graph and applications
+Normal rank
@@ Property / cites work @@
+Graphs with unique maximum independent sets
@@ Property / cites work: Graphs with unique maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Maximal Independent Sets in Triangle-Free Graphs
+Normal rank
@@ Property / cites work @@
+The number of maximum independent sets in graphs
@@ Property / cites work: The number of maximum independent sets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independence, odd girth, and average degree
@@ Property / cites work: Independence, odd girth, and average degree / rank @@
+Normal rank
@@ Property / cites work @@
+Q4912130
@@ Property / cites work: Q4912130 / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus–Gaddum problem in terms of G-free coloring
+Normal rank
@@ Property / cites work @@
+A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
+Normal rank
@@ Property / cites work @@
+On the maximum induced forests of a connected cubic graph without triangles
+Normal rank