BIRS Workshop Lecture Videos
Detecting an induced subdivision of \(K_4\) Le, Ngoc Khang
We propose a polynomial-time algorithm to test whether a given graph contains a subdivision of \(K_4\) as an induced subgraph. This continues the study of detecting an induced subdivision of \(H\) for some fixed graph \(H\), which is still far from being complete. Our result answers a question posed by Chudnovsky et al. and Lévêque et al.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International