Coloring of (P5, 4-wheel)-free graphs

Article Type

Research Article

Publication Title

Discrete Mathematics

Abstract

For a graph G, χ(G) (ω(G)) denote its chromatic (clique) number. A P5 is the chordless path on five vertices, and a 4-wheel is the graph consisting of a chordless cycle on four vertices C4 plus an additional vertex adjacent to all the vertices of the C4. In this paper, we show that every (P5, 4-wheel)-free graph G satisfies [Formula presented]. Moreover, this bound is almost tight. That is, there is a class of (P5, 4-wheel)-free graphs L such that every graph H∈L satisfies [Formula presented]. This generalizes/improves several previously known results in the literature.

DOI

10.1016/j.disc.2022.112795

Publication Date

5-1-2022

Comments

Open Access, Green

This document is currently not available here.

Share

COinS