Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098): Difference between revisions

@@ 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.endm.2011.05.016
+Normal rank
@@ Property / OpenAlex ID @@
+W4252125530
@@ Property / OpenAlex ID: W4252125530 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-contraction problems
@@ Property / cites work: Edge-contraction problems / rank @@
+Normal rank
@@ Property / cites work @@
+A vertex incremental approach for maintaining chordality
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / 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 Contracting Graphs to Fixed Pattern Graphs
@@ Property / cites work: On Contracting Graphs to Fixed Pattern Graphs / 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 @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank