Colouring graphs with no induced six-vertex path or diamond

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is (P6, diamond)-free if it contains no induced subgraph isomorphic to a six-vertex path or a diamond. In this paper we show that the chromatic number of a (P6, diamond)-free graph G is no larger tha...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 941; pp. 278 - 299
Main Authors:	Goedgebeur, Jan, Huang, Shenwei, Ju, Yiao, Merkel, Owen
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.01.2023
Subjects:	Graph colouring Lovász theta function Polynomial-time algorithms Strong perfect graph theorem χ-boundedness Graph colouring Lovász theta function Polynomial-time algorithms Strong perfect graph theorem χ-boundedness
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!