Graphs with No Induced Five-Vertex Path or Antipath

Publication: Research - peer-reviewJournal article – Annual report year: 2016

Documents

DOI

View graph of relations

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
JournalJournal of Graph Theory
Volume84
Issue number3
Pages (from-to)221–232
ISSN0364-9024
DOIs
StatePublished - 2017

Bibliographical note

The accepted authors manuscript/post-print of this article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.

CitationsWeb of Science® Times Cited: 0

    Keywords

  • Forbidden subgraph, P5, Decomposition
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 121205886