Skip to main content

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
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.
Publication Date: Mar-2017
Electronic Publication Date: 12-Feb-2016
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
DOI: doi:10.1002/jgt.22022
ISSN: 0364-9024
Pages: 221 - 232
Type of Material: Journal Article
Journal/Proceeding Title: Journal of Graph Theory
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.