Showing 2025Show all
2 papers · 1 filter
math.CO2025
Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
Mujin Choi, Maximilian Gorsky, Gunwoo Kim +2
We introduce the tree-decomposition-based graph parameter Odd-Cycle-Packing-treewidth (OCP-tw) as a width parameter that asks to decompose a given graph into pieces of bounded odd…
math.CO2025
Coloring Graphs With No Totally Odd Clique Immersion
Caleb McFarland
We prove that graphs that do not contain a totally odd immersion of are -colorable. In particular, we show that any graph with no totally odd immersion of $K_…