2 papers
cs.DS2026
On the parameterized complexity of computing good edge-labelings
Davi de Andrade, Júlio Araújo, Laure Morelle +2
A good edge-labeling (gel for short) of a graph is a function such that, for any ordered pair of vertices of , there do not exist two dist…
cs.DS2025
Computing parameters that generalize interval graphs using restricted modular partitions
Flavia Bonomo-Braberman, Eric Brandwein, Ignasi Sau
Recently, Lafond and Luo [MFCS 2023] defined the -modular cardinality of a graph as the minimum size of a partition of into modules that belong to a graph c…