Detecting an induced net subdivision
Discrete Mathematics
2020-12-01 v1 Combinatorics
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.
Cite
@article{arxiv.1309.1960,
title = {Detecting an induced net subdivision},
author = {Maria Chudnovsky and Paul Seymour and Nicolas Trotignon},
journal= {arXiv preprint arXiv:1309.1960},
year = {2020}
}