Showing math.COShow 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
Directed treewidth is closed under taking butterfly minors
Gunwoo Kim, Meike Hatzel, Stephan Kreutzer
Butterfly minors are a generalisation of the minor containment relation for undirected graphs to directed graphs. Many results in directed structural graph theory use this notion a…