Moritz Mühlenthaler

collaborators

3 papers

cs.DM2026

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes

Felix Hommelsheim, Pia Jehmlich, Moritz MÃ¼hlenthaler

Given an edge-colored graph, the Maximum Rainbow Matching problem asks for a maximum-cardinality matching of the graph that contains at most one edge from each color. We provide th…

cs.DM2024

Reconfiguring homomorphisms to reflexive graphs via a simple reduction

Moritz MÃ¼hlenthaler, Mark H. Siggers, Thomas Suzan

Given a graph $G$ and two graph homomorphisms $I^\pm$ and $I^^{2}$ from $G$ to a fixed graph $H$ , the problem $H$ -Recoloring asks whether there is a transformation from $I^\pm$ to $I^^{2}$ that…

cs.DS2024

A simple quadratic kernel for Token Jumping on surfaces

Daniel W. Cranston, Moritz MÃ¼hlenthaler, Benjamin Peyrille

The problem \textsc{Token Jumping} asks whether, given a graph $G$ and two independent sets of \emph{tokens} $I$ and $J$ of $G$ , we can transform $I$ into $J$ by changing the posit…