Near optimal colourability on hereditary graph families

In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lovász theta function. A graph family G is near optimal colourable if there is a constant number c such that every graph G∈G satisfies χ(G)≤max⁡{c,ω(G)},...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 993; p. 114465
Main Authors:	Ju, Yiao, Huang, Shenwei
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.04.2024
Subjects:	Forbidden induced subgraphs Graph colouring Lovász theta function Polynomial time algorithm Graph colouring Lovász theta function Polynomial time algorithm Forbidden induced subgraphs
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!