Graphs without five-vertex path and four-vertex cycle

DOI10.1016/J.AMC.2019.124602zbMath1433.05265OpenAlexW2964904548MaRDI QIDQ2286127

Shenwei Huang, Shu-Juan Cao

Publication date: 9 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.124602

zbMATH Keywords

forbidden induced subgraphsstructure theoremhereditary classesstrong perfect graph theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The structure of bull-free graphs II and III -- a summary
• The strong perfect graph theorem
• Triangle-free graphs with no six-vertex induced path
• Graphs with No Induced Five‐Vertex Path or Antipath

This page was built for publication: Graphs without five-vertex path and four-vertex cycle