2 papers
cs.CC2025
Analogy between List Coloring Problems and the Interval --choosability property: theoretical aspects of complexity
Simone Ingrid Monteiro Gama, Rosiane de Freitas Rodrigues
This work investigates structural and computational aspects of list-based graph coloring under interval constraints. Building on the framework of analogous and p-analogous problems…
cs.CC2018
Choosability in bounded sequential list coloring
Simone Gama, Rosiane de Freitas, Mário Salvatierra
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, a…