Katarzyna Paluch

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2024

Clique-free t-matchings in degree-bounded graphs

Katarzyna Paluch, Mateusz Wasylkiewicz

We consider problems of finding a maximum size/weight $t$ -matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t + 1$ , where $t$ is an…

cs.DS2023

Triangle-free 2-matchings

Katarzyna Paluch

We consider the problem of finding a maximum size triangle-free $2$ -matching in a graph $G = (V, E)$ . A (simple) $2$ -matching is any subset of the edges such that each vertex is incid…