On the chromatic number of \(2 K_2\)-free graphs
type: Item
instance of: scholarly article
title: On the chromatic number of \(2 K_2\)-free graphs
zbMATH Open document ID: 1401.05105
author: Christoph Brause
author: Bert Randerath
author: Ingo Schiermeyer
author: Vumar Elkin
published in: Discrete Applied Mathematics
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6994879
zbMATH Keywords: chromatic number
zbMATH Keywords: \(\chi\)-binding function
zbMATH Keywords: \(2 K_2\)-free graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2018.09.030
OpenAlex ID: W2900184847
cites work: Colouring of \((P_3 \cup P_2)\)-free graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: The Independence Ratio of Regular Graphs
cites work: Q5422499
cites work: The strong perfect graph theorem
cites work: Claw-free graphs. VI: Colouring
cites work: On the coverings of graphs
cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
cites work: Recognizing claw-free perfect graphs
cites work: Graph Theory and Probability
cites work: The chromatic number of \(\{P_5,K_4\}\)-free graphs
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: Q5749319
cites work: Note on equitable colorings of graphs
cites work: Chromatic bounds for some classes of \(2 K_2\)-free graphs
cites work: The Ramsey number R(3, t) has order of magnitude t2/log t
cites work: On the chromatic number of (P_{5},windmill)-free graphs
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
DOI: 10.1016/J.DAM.2018.09.030
description: scientific article; zbMATH DE number 6994879