Showing 2025Show all
3 papers · 1 filter
math.CO2025
List coloring ordered graphs with forbidden induced subgraphs
Marta Piecyk, Paweł Rzążewski
In the List -Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of . We need to decide if admits a proper co…
cs.DM2025
On Approximate MMS Allocations on Restricted Graph Classes
Václav Blažej, Michał Dębski, Zbigniew Lonc +2
We study the problem of fair division of a set of indivisible goods with connectivity constraints. Specifically, we assume that the goods are represented as vertices of a connected…
math.CO2025
Kernelization for list -coloring for graphs with small vertex cover
Marta Piecyk, Astrid Pieterse, Paweł Rzążewski +1
For a fixed graph , in the List -Coloring problem, we are given a graph along with list for every , and we have to determine if there ex…