Title

Coloring graphs with no induced five-vertex path or gem

Document Type

Article

Publication Date

12-1-2020

Abstract

© 2020 Wiley Periodicals, Inc. For a graph (Formula presented.), let (Formula presented.) and (Formula presented.), respectively, denote the chromatic number and clique number of (Formula presented.). We give an explicit structural description of ((Formula presented.), gem)-free graphs, and show that every such graph (Formula presented.) satisfies (Formula presented.). Moreover, this bound is best possible. Here a gem is the graph that consists of an induced four-vertex path plus a vertex which is adjacent to all the vertices of that path.

Publication Name

Journal of Graph Theory

Volume Number

95

First Page

527

Last Page

542

Issue Number

4

DOI

10.1002/jgt.22572

This document is currently not available here.

Share

COinS