Detecting an induced net subdivision
arXiv:1309.1960 · doi:10.1016/j.jctb.2013.07.005
Abstract
A {\em net} is a graph consisting of a triangle and three more vertices, each of degree one and with its neighbour in , and all adjacent to different vertices of . We give a polynomial-time algorithm to test whether an input graph has an induced subgraph which is a subdivision of a net. Unlike many similar questions, this does not seem to be solvable by an application of the "three-in-a-tree" subroutine.