Detecting induced subdivision of K₄
classification
💻 cs.DM
keywords
inducedsubdivisionalgorithmcontainsdetectinggivengraphpolynomial-time
read the original abstract
In this paper, we propose a polynomial-time algorithm to test whether a given graph contains a subdivision of $K_4$ as an induced subgraph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.