Solving problems on generalized convex graphs via mim-width
From MaRDI portal
Publication:832860
Cites work
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Bounding the Mim-Width of Hereditary Graph Classes.
- Circular convex bipartite graphs: feedback vertex sets
- Clique-width for hereditary graph classes
- Clique-width of graphs defined by one-vertex extensions
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Dominating induced matching in some subclasses of bipartite graphs
- Domination in some subclasses of bipartite graphs
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Feedback Vertex Sets on Tree Convex Bipartite Graphs
- Feedback vertex sets on restricted bipartite graphs
- Graph Classes: A Survey
- 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
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
- Independent domination on tree convex bipartite graphs
- Linear MIM-width of trees
- List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
- List coloring in the absence of a linear forest
- Maximum weight induced matching in some subclasses of bipartite graphs
- Mim-width. II. The feedback vertex set problem
- More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On list \(k\)-coloring convex bipartite graphs
- On planar supports for hypergraphs
- On the clique-width of some perfect graph classes
- On the thinness and proper thinness of a graph
- Recent developments on graphs of bounded clique-width
- Restricted Bipartite Graphs: Comparison and Hardness Results
- The stable set problem and the thinness of a graph
- Tractable connected domination for restricted bipartite graphs
- Tractable feedback vertex sets in restricted bipartite graphs
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
- Understanding model counting for \(\beta\)-acyclic CNF-formulas
- Upper bounds to the clique width of graphs
Cited in
(9)- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs
- On the thinness of trees
- Mim-width. III. Graph powers and generalized distance domination problems
- Classes of intersection digraphs with good algorithmic properties
- Bounding the mim‐width of hereditary graph classes
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Solving problems on generalized convex graphs via mim-width
- On convexity in split graphs: complexity of Steiner tree and domination
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
This page was built for publication: Solving problems on generalized convex graphs via mim-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832860)
