Vizing Bound for the Chromatic Number on Some Graph Classes

Article Type

Research Article

Publication Title

Graphs and Combinatorics

Abstract

We are interested in hereditary classes of graphs G such that every graph G∈ G satisfies χ(G) ≤ ω(G) + 1 , where χ(G) (ω(G)) denote the chromatic (clique) number of G. This upper bound is called the Vizing bound for the chromatic number. Apart from perfect graphs few classes are known to satisfy the Vizing bound in the literature. We show that if G is (P6, S1 , 2 , 2, diamond)-free, then χ(G) ≤ ω(G) + 1 , and we give examples to show that the bound is sharp.

First Page

1447

Last Page

1460

DOI

10.1007/s00373-015-1651-1

Publication Date

7-1-2016

Link to Full Text

Share

COinS