Graphs with No Induced Five-Vertex Path or Antipath

Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)221-232
Number of pages12
JournalJournal of Graph Theory
Volume84
Issue number3
DOIs
StatePublished - Mar 1 2017

All Science Journal Classification (ASJC) codes

  • Geometry and Topology

Keywords

  • P5
  • decomposition
  • forbidden subgraph

Fingerprint Dive into the research topics of 'Graphs with No Induced Five-Vertex Path or Antipath'. Together they form a unique fingerprint.

  • Cite this

    Chudnovsky, M., Esperet, L., Lemoine, L., Maceli, P., Maffray, F., & Penev, I. (2017). Graphs with No Induced Five-Vertex Path or Antipath. Journal of Graph Theory, 84(3), 221-232. https://doi.org/10.1002/jgt.22022