research
∙
08/21/2023
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T...
share
research
∙
07/11/2023
Complexity results for matching cut problems in graphs without long induced paths
In a graph, a (perfect) matching cut is an edge cut that is a (perfect) ...
research
∙
03/13/2022
On the d-Claw Vertex Deletion Problem
Let d-claw (or d-star) stand for K_1,d, the complete bipartite graph wit...
research
∙
07/13/2021
The Perfect Matching Cut Problem Revisited
In a graph, a perfect matching cut is an edge cut that is a perfect matc...
research
∙
01/11/2021
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst...
research
∙
12/10/2018
Map graphs having witnesses of large girth
A half-square of a bipartite graph B=(X,Y,E_B) has one color class of B ...
research
∙
04/30/2018
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter
In a graph, a matching cut is an edge cut that is a matching. Matching C...
research
∙
04/16/2018