Abstract

In this article, we propose a polynomial-time algorithm to test whether a given graph contains a subdivision of K4 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 by Chudnovsky et al. and Lévêque et al.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call