activity
20092026
most citedA complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

27 citations · 75 across the 18 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.DM2013★ 21 cited

Complexity Results for Rainbow Matchings

Van Bang Le, Florian Pfender

A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, \mrbm: Given an edge-colored g…

math.CO2013

Forests and Trees among Gallai Graphs

Felix Joos, Van Bang Le, Dieter Rautenbach

The Gallai graph of a graph has the edges of as its vertices and two distinct vertices and of are adjacent in if the edges and of a…