Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
type: Item
instance of: scholarly article
title: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
zbMATH Open document ID: 1216.05026
author: N. R. Aravind
author: T. Karthick
author: C. R. Subramanian
published in: Discrete Mathematics
publication date: 2011-05-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5888515
zbMATH Keywords: vertex coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: clique number
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
full work available at URL: j.disc.2011.02.021
OpenAlex ID: W1775534754
cites work: Stability number of bull- and chair-free graphs revisited
cites work: Graph Classes: A Survey
cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
cites work: Q5782525
cites work: The strong perfect graph theorem
cites work: The smallest triangle-free 4-chromatic 4-regular graph
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: On the stable set problem in special \(P_{5}\)-free graphs
cites work: Q3836509
cites work: 25 pretty graph colouring problems
cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals
cites work: Bounding χ in terms of ω and Δ for quasi-line graphs
cites work: An upper bound for the chromatic number of line graphs
cites work: Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
cites work: A Note On Reed's Conjecture
cites work: Vertex colouring and forbidden subgraphs -- a survey
cites work: Q4242948
cites work: On a property of the class of n-colorable graphs
DOI: 10.1016/J.DISC.2011.02.021
description: scientific article; zbMATH DE number 5888515