3 papers
math.CO2023
Partitioning edges of a planar graph into linear forests and a matching
Marthe Bonamy, Jadwiga Czyżewska, Łukasz Kowalik +1
We show that the edges of any planar graph of maximum degree at most can be partitioned into linear forests and a matching. Combined with known results, this implies that t…
cs.DS2017
Improving TSP tours using dynamic programming over tree decomposition
Marek Cygan, Lukasz Kowalik, Arkadiusz Socala
Given a traveling salesman problem (TSP) tour in graph a -move is an operation which removes edges from , and adds edges of so that a new tour is for…
cs.DS2016
Tight lower bounds for the complexity of multicoloring
Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk +2
In the multicoloring problem, also known as (:)-coloring or -fold coloring, we are given a graph G and a set of colors, and the task is to assign a subset of color…