
Solving problems on generalized convex graphs via mimwidth
A bipartite graph G=(A,B,E) is Hconvex, for some family of graphs H, if...
read it

List kColouring P_tFree Graphs with No Induced 1Subdivision of K_1,s: a Mimwidth Perspective
A colouring of a graph G=(V,E) is a mapping c V→{1,2,…} such that c(u)≠ ...
read it

Sublinear Longest Path Transversals and Gallai Families
We show that connected graphs admit sublinear longest path transversals....
read it

Approximating Independent Set and Dominating Set on VPG graphs
We consider Independent Set and Dominating Set restricted to VPG graphs ...
read it

Bounding the MimWidth of Hereditary Graph Classes
A large number of NPhard graph problems become polynomialtime solvable...
read it

CPG graphs: Some structural and hardness results
In this paper we continue the systematic study of Contact graphs of Path...
read it

Semitotal Domination: New hardness results and a polynomialtime algorithm for graphs of bounded mimwidth
A semitotal dominating set of a graph G with no isolated vertex is a dom...
read it
Andrea Munaro
is this you? claim profile