Increasing the minimum degree of a graph by contractions (Q385061): Difference between revisions

@@ Property / author @@
-Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
-Normal rank
@@ Property / author @@
+Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2063166459
@@ Property / OpenAlex ID: W2063166459 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding small degree-constrained subgraphs
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge Contractions in Subclasses of Chordal Graphs
@@ Property / cites work: Edge Contractions in Subclasses of Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Contraction and Treewidth Lower Bounds
@@ Property / cites work: Contraction and Treewidth Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity Status of Problems Related to Sparsest Cuts
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Large Clique Minors is Hard
@@ Property / cites work: Finding Large Clique Minors is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q5461510
@@ Property / cites work: Q5461510 / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting chordal graphs and bipartite graphs to paths and trees
+Normal rank
@@ Property / cites work @@
+Q2911626
@@ Property / cites work: Q2911626 / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting graphs to paths and trees
@@ Property / cites work: Contracting graphs to paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+On graph contractions and induced minors
@@ Property / cites work: On graph contractions and induced minors / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs into connected parts
@@ Property / cites work: Partitioning graphs into connected parts / rank @@
+Normal rank
@@ Property / cites work @@
+Contractions of Planar Graphs in Polynomial Time
@@ Property / cites work: Contractions of Planar Graphs in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph contractions II: Two tough polynomially solvable cases
+Normal rank
@@ Property / cites work @@
+Finding small separators in linear time via treewidth reduction
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for a Visible, Lazy Fugitive
@@ Property / cites work: Searching for a Visible, Lazy Fugitive / rank @@
+Normal rank
@@ Property / cites work @@
+On the removal of forbidden graphs by edge-deletion or by edge- contraction
+Normal rank
@@ Property / cites work @@
+On the NP-hardness of edge-deletion and -contraction problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:385061