Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2019.01.074
@@ Property / DOI: 10.1016/j.amc.2019.01.074 / rank @@
-Normal rank
@@ 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 / full work available at URL @@
+https://doi.org/10.1016/j.amc.2019.01.074
+Normal rank
@@ Property / OpenAlex ID @@
+W2911678318
@@ Property / OpenAlex ID: W2911678318 / rank @@
+Normal rank
@@ Property / cites work @@
+Decycling graphs
@@ Property / cites work: Decycling graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Circuits Contained in a Graph
@@ Property / cites work: On Independent Circuits Contained in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility Among Combinatorial Problems
@@ Property / cites work: Reducibility Among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for the connected vertex cover problem in 4-regular graphs
+Normal rank
@@ Property / cites work @@
+A New Class of Brittle Graphs
@@ Property / cites work: A New Class of Brittle Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a unique tree representation for \(P_ 4\)-extendible graphs
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+Q3836509
@@ Property / cites work: Q3836509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent packings in structured graphs
@@ Property / cites work: Independent packings in structured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle lengths and chromatic number of graphs
@@ Property / cites work: Cycle lengths and chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithm for the vertex cover \(P_k\) problem on cacti
+Normal rank
@@ Property / cites work @@
+Q4770411
@@ Property / cites work: Q4770411 / rank @@
+Normal rank
@@ Property / cites work @@
+Total dominating sequences in trees, split graphs, and under modular decomposition
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2019.01.074
@@ Property / DOI: 10.1016/J.AMC.2019.01.074 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2010691