Bounding the Mim-Width of Hereditary Graph Classes.
From MaRDI portal
Recommendations
Cites work
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Bounding clique-width via perfect graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Clique-width for graph classes closed under complementation
- Clique-width for hereditary graph classes
- Clique-width of graphs defined by one-vertex extensions
- Colouring diamond-free graphs
- Colouring vertices of triangle-free graphs without forests
- Counting minimal transversals of -acyclic hypergraphs
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Graph classes with structured neighborhoods and algorithmic applications
- Graph minors. X: Obstructions to tree-decomposition
- Hardness of computing width parameters based on branch decompositions over the vertex set
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- scientific article; zbMATH DE number 1472167 (Why is no real title available?)
- scientific article; zbMATH DE number 5279372 (Why is no real title available?)
- scientific article; zbMATH DE number 7651174 (Why is no real title available?)
- List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
- List coloring in the absence of a linear forest
- Lower bounds on the mim-width of some graph classes
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Mim-width. I. Induced path problems
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the induced matching problem
- On the tractability of optimization problems on \(H\)-graphs
- Recent developments on graphs of bounded clique-width
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- The behavior of clique-width under graph operations and graph transformations
- The point-set embeddability problem for plane graphs
- Tight bounds on maximal and maximum matchings
- Understanding model counting for -acyclic CNF-formulas
- Upper bounds to the clique width of graphs
Cited in
(8)- List k-colouring P_t-free graphs: a mim-width perspective
- Mim-width. III. Graph powers and generalized distance domination problems
- Steiner trees for hereditary graph classes: a treewidth perspective
- On algorithmic applications of sim-width and mim-width of (H₁,H₂)-free graphs
- Finding Large H-Colorable Subgraphs in Hereditary Graph Classes
- Bounding the mim‐width of hereditary graph classes
- On \(d\)-stable locally checkable problems parameterized by mim-width
- Solving problems on generalized convex graphs via mim-width
This page was built for publication: Bounding the Mim-Width of Hereditary Graph Classes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089650)
