The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs

In this paper, we study the class of graphs C defined by excluding the following structures as induced subgraphs: theta, pyramid, 1‐wheel, and 3‐wheel. We describe the structure of graphs in C, and we give a polynomial‐time recognition algorithm for this class. We also prove that K 4‐free graphs in...

Full description

Saved in:
Bibliographic details
Volume: 90
Main Author: Boncompagni, Valerio
Radovanović, Marko
Vušković, Kristina
Format: Journal Article
Language: English
Place of publication: 01.04.2019
published in: Journal of graph theory Vol. 90; no. 4; pp. 591 - 628
Data of publication: April 2019
ISSN: 0364-9024
EISSN: 1097-0118
Discipline: Mathematics
Bibliography: Correction added after online publication on 08 November 2018: “co‐nanoparticle (co‐NP)” has been changed to co‐NP
Online Access: Fulltext
Database: Wiley-Blackwell Open Access Titles
Wiley Free Content
Database information Databases - DBIS