Graphs with No Induced Five-Vertex Path or Antipath

Author(s): Chudnovsky, Maria; Esperet, Louis; Lemoine, Laetitia; Maceli, Peter; Maffray, Frédéric; et al

Download

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chudnovsky, Maria	-
dc.contributor.author	Esperet, Louis	-
dc.contributor.author	Lemoine, Laetitia	-
dc.contributor.author	Maceli, Peter	-
dc.contributor.author	Maffray, Frédéric	-
dc.contributor.author	Penev, Irena	-
dc.date.accessioned	2017-04-04T20:16:08Z	-
dc.date.available	2017-04-04T20:16:08Z	-
dc.date.issued	2017-03	en_US
dc.identifier.citation	Chudnovsky, Maria, Esperet, Louis, Lemoine, Laetitia, Maceli, Peter, Maffray, Frédéric, Penev, Irena. (2017). Graphs with No Induced Five-Vertex Path or Antipath. Journal of Graph Theory, 84 (3), 221 - 232. doi:10.1002/jgt.22022	en_US
dc.identifier.issn	0364-9024	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1mk78	-
dc.description.abstract	We prove that a graph G contains no induced math formula-vertex path and no induced complement of a math formula-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class-preserving operation introduced here.	en_US
dc.format.extent	221 - 232	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	Journal of Graph Theory	en_US
dc.rights	Author's manuscript	en_US
dc.title	Graphs with No Induced Five-Vertex Path or Antipath	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1002/jgt.22022	-
dc.date.eissued	2016-02-12	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
1410.0871v2.pdf		335.83 kB	Adobe PDF	View/Download