Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656855 | Journal of Combinatorial Theory, Series B | 2013 | 12 Pages |
Abstract
A net is a graph consisting of a triangle C and three more vertices, each of degree one and with its neighbour in C, and all adjacent to different vertices of C. 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Maria Chudnovsky, Paul Seymour, Nicolas Trotignon,