Chromatic bounds for the subclasses of \(pK_2\)-free graphs
type: Item
instance of: scholarly article
title: Chromatic bounds for the subclasses of \(pK_2\)-free graphs
DOI: 10.1007/978-3-030-67899-9_23
author: Athmakoori Prashant
author: M. Gokulnath
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 7497539
zbMATH Keywords: coloring
zbMATH Keywords: chromatic number
zbMATH Keywords: \( \chi \)-binding funtion
zbMATH Keywords: \(2K_2\)-free graphs
zbMATH Keywords: \(pK_2\)-free graphs
MaRDI profile type: Publication
full work available at URL: 978-3-030-67899-9 23
OpenAlex ID: W3127981037
cites work: Colouring of \((P_3 \cup P_2)\)-free graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: Triangle-free graphs and forbidden subgraphs
cites work: On the chromatic number of \(2 K_2\)-free graphs
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: $(2P_2,K_4)$-Free Graphs are 4-Colorable
cites work: Q5749319
cites work: Vizing bound for the chromatic number on some graph classes
cites work: Chromatic bounds for some classes of \(2 K_2\)-free graphs
cites work: Vertex colouring and forbidden subgraphs -- a survey
cites work: Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
cites work: Q5311854
description: scientific article; zbMATH DE number 7497539