Clique-width and induced topological minors
Pawe{\l} Rafa{\l} Bieli\'nski, Jadwiga Czy\.zewska, Martin Milani\v{c}, Amir Nikabadi, Pawe{\l} Rz\k{a}\.zewski

TL;DR
This paper characterizes which graphs have classes of graphs with bounded clique-width when excluding induced subdivisions, specifically identifying $P_4$, paw, and diamond as key structures.
Contribution
It provides a complete characterization of graphs $H$ for which the class of graphs with no induced subdivision of $H$ has bounded clique-width.
Findings
Bounded clique-width classes are characterized by $H$ being an induced subgraph of $P_4$, paw, or diamond.
Answers a question posed by Dabrowski, Johnson, and Paulusma.
Establishes a precise structural criterion for bounded clique-width in induced subdivision classes.
Abstract
A is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique of size four by removing two adjacent edges of the clique. We prove that for a graph , the class of graphs with no induced subdivision of has bounded clique-width if and only if is an induced subgraph of , the paw, or the diamond. This answers a~question of Dabrowski, Johnson, and Paulusma.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
