On Generating Triangle-Free Graphs (Q2839211): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2009.02.008
@@ Property / DOI: 10.1016/j.endm.2009.02.008 / rank @@
-Normal rank
@@ Property / cites work @@
+Kernelization Algorithms for d-Hitting Set Problems
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Automated generation of search tree algorithms for hard graphs modification problems
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Subgraphs without Short Cycles
+Normal rank
@@ Property / cites work @@
+A Problem Kernelization for Graph Packing
@@ Property / cites work: A Problem Kernelization for Graph Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2009.02.008
@@ Property / DOI: 10.1016/J.ENDM.2009.02.008 / rank @@
+Normal rank