4 citations · 12 across the 12 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022★ 1 cited
-Coloring Parameterized by Pathwidth is XNLP-complete
Lars Jaffke, Paloma T. Lima, Roohani Sharma
We show that the -Coloring problem is complete for the class XNLP when parameterized by the pathwidth of the input graph. Besides determining the precise parameterized complexit…
cs.CC2019
Reducing the domination number of graphs via edge contractions
Esther Galby, Paloma T. Lima, Bernard Ries
In this paper, we study the following problem: given a connected graph , can we reduce the domination number of by at least one using edge contractions, for some fixed i…