Critical elements in combinatorially closed families of graph classes (Q5269161): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115195
@@ Property / cites work: Q3115195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115202
@@ Property / cites work: Q3115202 / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of graphs critical for the edge list-ranking problem
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+NP-hard graph problems and boundary classes of graphs
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Hardness results for approximating the bandwidth
@@ Property / cites work: Hardness results for approximating the bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Line graphs of bounded clique-width
@@ Property / cites work: Line graphs of bounded clique-width / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Q4739929
@@ Property / cites work: Q4739929 / rank @@
+Normal rank
@@ Property / cites work @@
+The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
+Normal rank