3 papers
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
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
Mujin Choi, Sebastian Wiederrecht
A -ladder is the graph obtained from two disjoint paths, each with vertices, by joining the th vertices of both paths with an edge for each . In this…
math.CO2025
Excluding an induced wheel minor in graphs without large induced stars
Mujin Choi, Claire Hilaire, Martin Milanič +1
We study a conjecture due to Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht stating that for any positive integer and any planar graph , the class of all $K_…