To refer to this page use:
|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.|
|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|
|Pages:||221 - 232|
|Type of Material:||Journal Article|
|Journal/Proceeding Title:||Journal of Graph Theory|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.