27 citations · 75 across the 18 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023★ 1 cited
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Van Bang Le, Christian Rosenke
A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the dis…
cs.CC2023
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
Hoang-Oanh Le, Van Bang Le
In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. Matching Cut (MC), respectively, Perfect Matching Cut (PMC), is the problem of deciding whether a…