Minimum \(k\)-path vertex cover (Q2275922): Difference between revisions

@@ Property / author @@
-Gabriel Semanisin
@@ Property / author: Gabriel Semanisin / rank @@
-Normal rank
@@ Property / author @@
+Gabriel Semanisin
@@ Property / author: Gabriel Semanisin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2052790720
@@ Property / OpenAlex ID: W2052790720 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2088
@@ Property / arXiv ID: 1012.2088 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4111593
@@ Property / cites work: Q4111593 / rank @@
+Normal rank
@@ Property / cites work @@
+Transversal numbers of uniform hypergraphs
@@ Property / cites work: Transversal numbers of uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489165
@@ Property / cites work: Q4489165 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q5501833
@@ Property / cites work: Q5501833 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Detour Chromatic Numbers
@@ Property / cites work: Detour Chromatic Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Aided Systems Theory – EUROCAST 2005
@@ Property / cites work: Computer Aided Systems Theory – EUROCAST 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On F-independence in graphs
@@ Property / cites work: On F-independence in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The independence number in graphs of maximum degree three
+Normal rank
@@ Property / cites work @@
+On the independence number of a graph in terms of order and size
+Normal rank
@@ Property / cites work @@
+On the tightness of the \(\frac {5}{14}\) independence ratio
+Normal rank
@@ Property / cites work @@
+A new proof of the independence ratio of triangle-free cubic graphs
+Normal rank
@@ Property / cites work @@
+Computational complexity of \((2,2)\) path chromatic number problem
+Normal rank
@@ Property / cites work @@
+Q4294602
@@ Property / cites work: Q4294602 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / 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 @@
+Q3688407
@@ Property / cites work: Q3688407 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal analysis of security protocols for wireless sensor networks
+Normal rank
@@ Property / cites work @@
+Total domination of graphs and small transversals of hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank