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)},...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 993; s. 114465
Hlavní autori:	Ju, Yiao, Huang, Shenwei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 27.04.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!