Colouring of (P3? P2) -free graphs

Title

Colouring of (P3? P2) -free graphs

Creator

Bharathi A.P.; Choudum S.A.

Description

The class of 2 K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3? P2) -free graphs, a super class of 2 K2-free graphs. We derive a O(?3) upper bound for the chromatic number of (P3? P2) -free graphs, and sharper bounds for (P3? P2, diamond)-free graphs and for (2 K2, diamond)-free graphs, where ? denotes the clique number. The last two classes are perfect if ?? 5 and ? 4 respectively. 2017, Springer Japan KK, part of Springer Nature.

Source

Graphs and Combinatorics, Vol-34, No. 1, pp. 97-107.

Date

2018-01-01

Publisher

Springer Tokyo

Subject

(P₃? P₂) -free graphs; 2 K₂-free graphs; Chromatic number; Clique number; Colouring; Diamond; Perfect graphs

Coverage

Bharathi A.P., Department of Mathematics, Christ University, Bengaluru, 560029, India; Choudum S.A., Guest Faculty, Department of Mathematics, Christ University, Bengaluru, 560029, India

Rights

All Open Access; Green Open Access

Relation

ISSN: 9110119

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s00373-017-1870-8

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85039718429&doi=10.1007%2fs00373-017-1870-8&partnerID=40&md5=3846c9b239f12b60d9495fafc9b3f5b0