1 citations · 1 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Finding large -colorable induced subgraphs in (bull, chair)-free and (bull,E)-free graphs
Nadzieja Hodur, Monika Pilśniak, Magdalena Prorok +1
We study the Max Partial -Coloring problem, where we are given a vertex-weighted graph, and we ask for a maximum-weight induced subgraph that admits a proper -coloring. For $…
cs.CC2024
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
Barış Can Esmer, Jacob Focke, Dániel Marx +1
It is known for many algorithmic problems that if a tree decomposition of width is given in the input, then the problem can be solved with exponential dependence on . A line…