Paloma T. Lima

collaborators

3 papers

math.CO2025

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs

Esther Galby, Paloma T. Lima, Andrea Munaro +1

We show that, for every fixed positive integers $r$ and $k$ , \textsc{Max-Weight List $r$ -Colorable Induced Subgraph} admits a polynomial-time algorithm on $k P_{3}$ -free graphs. This…

math.CO2024

Non-empty intersection of longest paths in $P_{5}$ -free and claw-free graphs

Paloma T. Lima, Amir Nikabadi

A family $F$ of graphs is a \textit{Gallai family} if for every connected graph $G \in F$ , all longest paths in $G$ have a common vertex. While it is not known w…

cs.DS2024

Odd Cycle Transversal on $P_{5}$ -free Graphs in Polynomial Time

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov +3

An independent set in a graph G is a set of pairwise non-adjacent vertices. A graph $G$ is bipartite if its vertex set can be partitioned into two independent sets. In the Odd Cycl…

Maximum list r-colorable induced subgraphs in kP3​-free graphs

Non-empty intersection of longest paths in P5​-free and claw-free graphs

Odd Cycle Transversal on P5​-free Graphs in Polynomial Time

Maximum list $r$ -colorable induced subgraphs in $k P_{3}$ -free graphs

Non-empty intersection of longest paths in $P_{5}$ -free and claw-free graphs

Odd Cycle Transversal on $P_{5}$ -free Graphs in Polynomial Time