Journal article · Preprint article
Graphs with No Induced Five-Vertex Path or Antipath
We prove that a graph G contains no induced five-vertex path and no induced complement of a five-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.
Language: | English |
---|---|
Year: | 2017 |
Pages: | 221-232 |
ISSN: | 10970118 and 03649024 |
Types: | Journal article and Preprint article |
DOI: | 10.1002/jgt.22022 |