Solving problems on generalized convex graphs via mim-width
type: Item
instance of: scholarly article
title: Solving problems on generalized convex graphs via mim-width
DOI: 10.1007/978-3-030-83508-8_15
author: Flavia Bonomo
author: Nick Brettell
author: Andrea Munaro
author: Daniël Paulusma
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2008.09004
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498678
MaRDI profile type: Publication
OpenAlex ID: W3171819820
cites work: Graph classes with structured neighborhoods and algorithmic applications
cites work: More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints
cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
cites work: On the thinness and proper thinness of a graph
cites work: Graph Classes: A Survey
cites work: Q2954991
cites work: Bounding the Mim-Width of Hereditary Graph Classes.
cites work: List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
cites work: On planar supports for hypergraphs
cites work: Boolean-width of graphs
cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
cites work: Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
cites work: List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)
cites work: Upper bounds to the clique width of graphs
cites work: List coloring in the absence of a linear forest
cites work: Clique-width for hereditary graph classes
cites work: On list \(k\)-coloring convex bipartite graphs
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
cites work: Linear MIM-width of trees
cites work: Mim-width. II. The feedback vertex set problem
cites work: Feedback vertex sets on restricted bipartite graphs
cites work: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
cites work: Recent developments on graphs of bounded clique-width
cites work: A width parameter useful for chordal and co-comparability graphs
cites work: Restricted Bipartite Graphs: Comparison and Hardness Results
cites work: Circular convex bipartite graphs: feedback vertex sets
cites work: Tractable connected domination for restricted bipartite graphs
cites work: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs
cites work: The stable set problem and the thinness of a graph
cites work: Approximating clique-width and branch-width
cites work: Dominating induced matching in some subclasses of bipartite graphs
cites work: Maximum weight induced matching in some subclasses of bipartite graphs
cites work: Domination in some subclasses of bipartite graphs
cites work: Clique-width of graphs defined by one-vertex extensions
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Hardness of computing width parameters based on branch decompositions over the vertex set
cites work: Independent Domination on Tree Convex Bipartite Graphs
cites work: Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth
cites work: Feedback Vertex Sets on Tree Convex Bipartite Graphs
description: scientific article; zbMATH DE number 7498678