Detecting an induced net subdivision

Author(s): Chudnovsky, Maria; Seymour, Paul D.; Trotignon, Nicolas

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1x96x

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Seymour, Paul D.	-
dc.contributor.author	Trotignon, Nicolas	-
dc.date.accessioned	2018-07-20T15:10:14Z	-
dc.date.available	2018-07-20T15:10:14Z	-
dc.date.issued	2013-09	en_US
dc.identifier.citation	Chudnovsky, Maria, Seymour, Paul, Trotignon, Nicolas. (2013). Detecting an induced net subdivision. JOURNAL OF COMBINATORIAL THEORY SERIES B, 103 (630 - 641. doi:10.1016/j.jctb.2013.07.005	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1x96x	-
dc.description.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. (C) 2013 Elsevier Inc. All rights reserved.	en_US
dc.format.extent	630 - 641	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	JOURNAL OF COMBINATORIAL THEORY SERIES B	en_US
dc.rights	Author's manuscript	en_US
dc.title	Detecting an induced net subdivision	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2013.07.005	-
dc.date.eissued	2013-08-23	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
10.1.1.754.2407.pdf		142.31 kB	Adobe PDF	View/Download