Graphs without five-vertex path and four-vertex cycle

Shujuan Cao and Shenwei Huang

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: In this paper, we give a structure theorem for graphs containing no five-vertex path or four-vertex cycle as an induced subgraphs.

Keywords: Hereditary classes; Forbidden induced subgraphs; Structure theorem; Strong perfect graph theorem (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305946
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:363:y:2019:i:c:32

DOI: 10.1016/j.amc.2019.124602

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().