Lower bounds on the mim-width of some graph classes (Q2413964): Difference between revisions

@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+On Compiling CNFs into Structured Deterministic DNNFs
+Normal rank
@@ Property / cites work @@
+Q2954991
@@ Property / cites work: Q2954991 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hamiltonian circuit problem for circle graphs is NP-complete
+Normal rank
@@ Property / cites work @@
+On Satisfiability Problems with a Linear Structure
+Normal rank
@@ Property / cites work @@
+On tree width, bramble size, and expansion
@@ Property / cites work: On tree width, bramble size, and expansion / rank @@
+Normal rank
@@ Property / cites work @@
+A width parameter useful for chordal and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Solving #SAT and MAXSAT by Dynamic Programming
@@ Property / cites work: Solving #SAT and MAXSAT by Dynamic Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The point-set embeddability problem for plane graphs
+Normal rank