Bounding the mim‐width of hereditary graph classes (Q6056798): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.22730
@@ Property / DOI: 10.1002/jgt.22730 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3195265556
@@ Property / OpenAlex ID: W3195265556 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q5075752
@@ Property / cites work: Q5075752 / rank @@
+Normal rank
@@ Property / cites work @@
+Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
+Normal rank
@@ Property / cites work @@
+Tight bounds on maximal and maximum matchings
@@ Property / cites work: Tight bounds on maximal and maximum matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width for Graph Classes Closed under Complementation
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4425939
@@ Property / cites work: Q4425939 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving problems on generalized convex graphs via mim-width
+Normal rank
@@ Property / cites work @@
+Q5387674
@@ Property / cites work: Q5387674 / rank @@
+Normal rank
@@ Property / cites work @@
+GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
+Normal rank
@@ Property / cites work @@
+Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
+Normal rank
@@ Property / cites work @@
+Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
+Normal rank
@@ Property / cites work @@
+Q2954991
@@ Property / cites work: Q2954991 / rank @@
+Normal rank
@@ Property / cites work @@
+List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Q5874504
@@ Property / cites work: Q5874504 / rank @@
+Normal rank
@@ Property / cites work @@
+List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring in the absence of a linear forest
@@ Property / cites work: List coloring in the absence of a linear forest / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring diamond-free graphs
@@ Property / cites work: Colouring diamond-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding clique-width via perfect graphs
@@ Property / cites work: Bounding clique-width via perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for hereditary graph classes
@@ Property / cites work: Clique-width for hereditary graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width and well-quasi-ordering of triangle-free graph classes
+Normal rank
@@ Property / cites work @@
+Colouring vertices of triangle-free graphs without forests
+Normal rank
@@ Property / cites work @@
+On the tractability of optimization problems on \(H\)-graphs
+Normal rank
@@ Property / cites work @@
+Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+The behavior of clique-width under graph operations and graph transformations
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of clique-transversal and clique-independent sets
+Normal rank
@@ Property / cites work @@
+Mim-width. III. Graph powers and generalized distance domination problems
+Normal rank
@@ Property / cites work @@
+Mim-width. I. Induced path problems
@@ Property / cites work: Mim-width. I. Induced path problems / rank @@
+Normal rank
@@ Property / cites work @@
+Mim-width. II. The feedback vertex set problem
@@ Property / cites work: Mim-width. II. The feedback vertex set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+A width parameter useful for chordal and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+On the induced matching problem
@@ Property / cites work: On the induced matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+Normal rank
@@ Property / cites work @@
+Lower bounds on the mim-width of some graph classes
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Clique-width of graphs defined by one-vertex extensions
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Hardness of computing width parameters based on branch decompositions over the vertex set
+Normal rank
@@ Property / DOI @@
+.1002/JGT.22730
@@ Property / DOI: 10.1002/JGT.22730 / rank @@
+Normal rank