Contracting chordal graphs and bipartite graphs to paths and trees (Q5920327): 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.dam.2013.02.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2180411372
@@ Property / OpenAlex ID: W2180411372 / rank @@
+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 @@
+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 @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+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 chordal graphs and bipartite graphs to paths and trees
+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 @@
+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 @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank