A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Solving Problems on Generalized Convex Graphs via Mim-Width
[article]
2022
arXiv
pre-print
A bipartite graph G=(A,B,E) is H-convex, for some family of graphs H, if there exists a graph H∈ H with V(H)=A such that the set of neighbours in A of each b∈ B induces a connected subgraph of H. Many 𝖭𝖯-complete problems, including problems such as Dominating Set, Feedback Vertex Set, Induced Matching and List k-Colouring, become polynomial-time solvable for ℋ-convex graphs when ℋ is the set of paths. In this case, the class of ℋ-convex graphs is known as the class of convex graphs. The
arXiv:2008.09004v4
fatcat:plgkd6s5x5cm5nh5dt75jhrfmq