Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903533 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ngoc Khang Le,